In C++ Plz LAB- Playlist (output linked list) Given main()- complete.pdf
•
0 likes•4 views
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; }.
Report
Share
Report
Share
Download to read offline
Recommended
In C++ Plz and In What Order Do I Put It In- LAB- Playlist (output li.pdf
In C++ Plz and In What Order Do I Put It In.
LAB: Playlist (output linked list)
Given main(), complete the SongNode class to include the function PrintSongInfo(). Then write
the PrintPlaylist() function in main.cpp to print all songs in the playlist. DO NOT print the
dummy head node.
Ex: If the input is:
the output is:
main.cpp Default Code:
#include <iostream>
#include "SongNode.h"
// TODO: Write PrintPlaylist() function
int main() {
SongNode* headNode;
SongNode* currNode;
SongNode* lastNode;
string songTitle;
string songLength;
string songArtist;
// Front of nodes list
headNode = new SongNode();
lastNode = headNode;
// Read user input until -1 entered
getline(cin, songTitle);
while (songTitle != "-1") {
getline(cin, songLength);
getline(cin, songArtist);
currNode = new SongNode(songTitle, songLength, songArtist);
lastNode->InsertAfter(currNode);
lastNode = currNode;
getline(cin, songTitle);
}
// Print linked list
cout << "LIST OF SONGS" << endl;
cout << "-------------" << endl;
PrintPlaylist(headNode);
return 0;
}
SongNode.h Default Code:
#include "iostream"
#include <string>
using namespace std;
class SongNode {
private:
string songTitle;
string songLength;
string songArtist;
SongNode* nextNodeRef; // Reference to the next node
public:
SongNode() {
songTitle = "";
songLength = "";
songArtist = "";
nextNodeRef = NULL;
}
// Constructor
SongNode(string songTitleInit, string songLengthInit, string songArtistInit);
// Constructor
SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode*
nextLoc);
// insertAfter
void InsertAfter(SongNode* nodeLoc);
// Get location pointed by nextNodeRef
SongNode* GetNext();
// Prints song information
void PrintSongInfo();
};
SongNode.cpp Default Code:
#include "SongNode.h"
// Constructor
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = NULL;
}
// Constructor
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit,
SongNode* nextLoc) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = nextLoc;
}
// insertAfter
void SongNode::InsertAfter(SongNode* nodeLoc) {
SongNode* tmpNext;
tmpNext = this->nextNodeRef;
this->nextNodeRef = nodeLoc;
nodeLoc->nextNodeRef = tmpNext;
}
// Get location pointed by nextNodeRef
SongNode* SongNode::GetNext() {
return this->nextNodeRef;
}
// TODO: Write PrintSongInfo() function
.
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;
}.
816 LAB Playlist output linked list Hey I have most of.pdf
8.16 LAB: Playlist (output linked list)
**Hey I have most of this done I just need to figure out to get rid of the indent/whitespace for this
Given main(), complete the SongNode class to include the function PrintSongInfo(). Then write the
PrintPlaylist() function in main.cpp to print all songs in the playlist. DO NOT print the dummy
head node.
Ex: If the input is:
the output is:
main.cpp
#include "SongNode.h"
void PrintPlaylist(SongNode* head) {
SongNode* temp = head->GetNext();
while (temp != nullptr) {
temp->PrintSongInfo();
temp = temp->GetNext();
}
}
int main() {
SongNode* headNode = new SongNode();
SongNode* currNode = nullptr;
SongNode* lastNode = headNode;
string songTitle;
string songLength;
string songArtist;
getline(cin, songTitle);
while (songTitle != "-1") {
getline(cin, songLength);
getline(cin, songArtist);
currNode = new SongNode(songTitle, songLength, songArtist);
lastNode->InsertAfter(currNode);
lastNode = currNode;
getline(cin, songTitle);
}
cout << "LIST OF SONGS" << endl;
cout << "-------------" << endl;
PrintPlaylist(headNode);
return 0;
}
SongNode.h
#include<iostream>
#include<string>
using namespace std;
class SongNode {
private:
string songTitle;
string songLength;
string songArtist;
SongNode* nextNodeRef;
public:
SongNode();
SongNode(string songTitleInit, string songLengthInit, string songArtistInit);
SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode* nextLoc);
void InsertAfter(SongNode* nodeLoc);
SongNode* GetNext();
void PrintSongInfo();
};
SongNode.cpp
#include "SongNode.h"
SongNode::SongNode() {
songTitle = "";
songLength = "";
songArtist = "";
nextNodeRef = nullptr;
}
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit) {
songTitle = songTitleInit;
songLength = songLengthInit;
songArtist = songArtistInit;
nextNodeRef = nullptr;
}
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode*
nextLoc) {
songTitle = songTitleInit;
songLength = songLengthInit;
songArtist = songArtistInit;
nextNodeRef = nextLoc;
}
void SongNode::InsertAfter(SongNode* nodeLoc) {
SongNode* tmpNext = nextNodeRef;
nextNodeRef = nodeLoc;
nodeLoc->nextNodeRef = tmpNext;
}
SongNode* SongNode::GetNext() {
return nextNodeRef;
}
void SongNode::PrintSongInfo() {
cout << "Title: " << songTitle << endl;
cout << "Length: " << songLength << endl;
cout << "Artist: " << songArtist << endl << endl;
}
zyBooks My library > CS 1119: Computer Programming With C++ home > 8.16: LAB: Playlist
(output linked list) zyBooks catalog ? Help/FAQ 8 Julia Fritsch I.TST OF SONC5 --itle: Stomp! Iitht
380 Length: Artiat: The Brothera Johnson Title: The Iude Length: 337 Artist: Quincy Jones Title:
You Don't Own Me Length: 151 Artist: Lesley Gore + LIsT of SoNCs -------- Title: Stome! Length:
380 Artist: The Brothers Johnson Title: The Dude Length: 337 Artist: Quincy Jones Title: You Don't
Own Me Artiat: Lesley Gore Expected cutput Title: The Dude.
1817 LAB Playlist output linked list Given main compl.pdf
18.17 LAB: Playlist (output linked list)
Given main(), complete the SongNode class to include the function PrintSongInfo(). Then write the
PrintPlaylist() function in main.cpp to print all songs in the playlist. DO NOT print the dummy
head node.
Ex: If the input is:
the output is:
#include "SongNode.h"
// Constructor
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = NULL;
}
// Constructor
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode*
nextLoc) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = nextLoc;
}
// insertAfter
void SongNode::InsertAfter(SongNode* nodeLoc) {
SongNode* tmpNext;
tmpNext = this->nextNodeRef;
this->nextNodeRef = nodeLoc;
nodeLoc->nextNodeRef = tmpNext;
}
// Get location pointed by nextNodeRef
SongNode* SongNode::GetNext() {
return this->nextNodeRef;
}
// TODO: Write PrintSongInfo() function
in C++ please, thank you!.
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);
}
}.
maincpp include ltiostreamgt include ltstringgt.pdf
main.cpp:
#include <iostream>
#include <string>
using namespace std;
class SongNode {
private:
string songTitle;
string songLength;
string songArtist;
SongNode* nextNodeRef;
public:
SongNode() {
songTitle = "";
songLength = "";
songArtist = "";
nextNodeRef = NULL;
}
SongNode(string songTitleInit, string songLengthInit, string songArtistInit);
SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode* nextLoc);
void InsertAfter(SongNode* nodeLoc);
SongNode* GetNext();
void PrintSongInfo();
};
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = NULL;
}
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode*
nextLoc) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = nextLoc;
}
void SongNode::InsertAfter(SongNode* nodeLoc) {
SongNode* tmpNext;
tmpNext = this->nextNodeRef;
this->nextNodeRef = nodeLoc;
nodeLoc->nextNodeRef = tmpNext;
}
SongNode* SongNode::GetNext() {
return this->nextNodeRef;
}
void SongNode::PrintSongInfo() {
cout << "Title: " << this->songTitle << endl;
cout << "Length: " << this->songLength << endl;
cout << "Artist: " << this->songArtist << endl << endl;
}
void PrintPlaylist(SongNode *song) {
song = song->GetNext();
while (song != NULL) {
song->PrintSongInfo();
song = song->GetNext();
}
}
int main() {
SongNode* headNode;
SongNode* currNode;
SongNode* lastNode;
string songTitle;
string songLength;
string songArtist;
headNode = new SongNode();
lastNode = headNode;
getline(cin, songTitle);
while (songTitle != "-1") {
getline(cin, songLength);
getline(cin, songArtist);
currNode = new SongNode(songTitle, songLength, songArtist);
lastNode->InsertAfter(currNode);
lastNode = currNode;
getline(cin, songTitle);
}
cout << "nLIST OF SONGS" << endl;
cout << "-------------" << endl;
PrintPlaylist(headNode);
return 0;
}
SongNode.h:
#include <iostream>
#include <string>
using namespace std;
class SongNode {
private:
string songTitle;
string songLength;
string songArtist;
SongNode* nextNodeRef; // Reference to the next node
public:
SongNode() {
songTitle = "";
songLength = "";
songArtist = "";
nextNodeRef = NULL;
}
// Constructor
SongNode(string songTitleInit, string songLengthInit, string songArtistInit);
// Constructor
SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode* nextLoc);
// insertAfter
void InsertAfter(SongNode* nodeLoc);
// Get location pointed by nextNodeRef
SongNode* GetNext();
// Prints song information
void PrintSongInfo();
};
// SongNode.cpp
// Constructor
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = NULL;
}
// Constructor
SongNode:.
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
}.
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)
{
.
Recommended
In C++ Plz and In What Order Do I Put It In- LAB- Playlist (output li.pdf
In C++ Plz and In What Order Do I Put It In.
LAB: Playlist (output linked list)
Given main(), complete the SongNode class to include the function PrintSongInfo(). Then write
the PrintPlaylist() function in main.cpp to print all songs in the playlist. DO NOT print the
dummy head node.
Ex: If the input is:
the output is:
main.cpp Default Code:
#include <iostream>
#include "SongNode.h"
// TODO: Write PrintPlaylist() function
int main() {
SongNode* headNode;
SongNode* currNode;
SongNode* lastNode;
string songTitle;
string songLength;
string songArtist;
// Front of nodes list
headNode = new SongNode();
lastNode = headNode;
// Read user input until -1 entered
getline(cin, songTitle);
while (songTitle != "-1") {
getline(cin, songLength);
getline(cin, songArtist);
currNode = new SongNode(songTitle, songLength, songArtist);
lastNode->InsertAfter(currNode);
lastNode = currNode;
getline(cin, songTitle);
}
// Print linked list
cout << "LIST OF SONGS" << endl;
cout << "-------------" << endl;
PrintPlaylist(headNode);
return 0;
}
SongNode.h Default Code:
#include "iostream"
#include <string>
using namespace std;
class SongNode {
private:
string songTitle;
string songLength;
string songArtist;
SongNode* nextNodeRef; // Reference to the next node
public:
SongNode() {
songTitle = "";
songLength = "";
songArtist = "";
nextNodeRef = NULL;
}
// Constructor
SongNode(string songTitleInit, string songLengthInit, string songArtistInit);
// Constructor
SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode*
nextLoc);
// insertAfter
void InsertAfter(SongNode* nodeLoc);
// Get location pointed by nextNodeRef
SongNode* GetNext();
// Prints song information
void PrintSongInfo();
};
SongNode.cpp Default Code:
#include "SongNode.h"
// Constructor
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = NULL;
}
// Constructor
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit,
SongNode* nextLoc) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = nextLoc;
}
// insertAfter
void SongNode::InsertAfter(SongNode* nodeLoc) {
SongNode* tmpNext;
tmpNext = this->nextNodeRef;
this->nextNodeRef = nodeLoc;
nodeLoc->nextNodeRef = tmpNext;
}
// Get location pointed by nextNodeRef
SongNode* SongNode::GetNext() {
return this->nextNodeRef;
}
// TODO: Write PrintSongInfo() function
.
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;
}.
816 LAB Playlist output linked list Hey I have most of.pdf
8.16 LAB: Playlist (output linked list)
**Hey I have most of this done I just need to figure out to get rid of the indent/whitespace for this
Given main(), complete the SongNode class to include the function PrintSongInfo(). Then write the
PrintPlaylist() function in main.cpp to print all songs in the playlist. DO NOT print the dummy
head node.
Ex: If the input is:
the output is:
main.cpp
#include "SongNode.h"
void PrintPlaylist(SongNode* head) {
SongNode* temp = head->GetNext();
while (temp != nullptr) {
temp->PrintSongInfo();
temp = temp->GetNext();
}
}
int main() {
SongNode* headNode = new SongNode();
SongNode* currNode = nullptr;
SongNode* lastNode = headNode;
string songTitle;
string songLength;
string songArtist;
getline(cin, songTitle);
while (songTitle != "-1") {
getline(cin, songLength);
getline(cin, songArtist);
currNode = new SongNode(songTitle, songLength, songArtist);
lastNode->InsertAfter(currNode);
lastNode = currNode;
getline(cin, songTitle);
}
cout << "LIST OF SONGS" << endl;
cout << "-------------" << endl;
PrintPlaylist(headNode);
return 0;
}
SongNode.h
#include<iostream>
#include<string>
using namespace std;
class SongNode {
private:
string songTitle;
string songLength;
string songArtist;
SongNode* nextNodeRef;
public:
SongNode();
SongNode(string songTitleInit, string songLengthInit, string songArtistInit);
SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode* nextLoc);
void InsertAfter(SongNode* nodeLoc);
SongNode* GetNext();
void PrintSongInfo();
};
SongNode.cpp
#include "SongNode.h"
SongNode::SongNode() {
songTitle = "";
songLength = "";
songArtist = "";
nextNodeRef = nullptr;
}
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit) {
songTitle = songTitleInit;
songLength = songLengthInit;
songArtist = songArtistInit;
nextNodeRef = nullptr;
}
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode*
nextLoc) {
songTitle = songTitleInit;
songLength = songLengthInit;
songArtist = songArtistInit;
nextNodeRef = nextLoc;
}
void SongNode::InsertAfter(SongNode* nodeLoc) {
SongNode* tmpNext = nextNodeRef;
nextNodeRef = nodeLoc;
nodeLoc->nextNodeRef = tmpNext;
}
SongNode* SongNode::GetNext() {
return nextNodeRef;
}
void SongNode::PrintSongInfo() {
cout << "Title: " << songTitle << endl;
cout << "Length: " << songLength << endl;
cout << "Artist: " << songArtist << endl << endl;
}
zyBooks My library > CS 1119: Computer Programming With C++ home > 8.16: LAB: Playlist
(output linked list) zyBooks catalog ? Help/FAQ 8 Julia Fritsch I.TST OF SONC5 --itle: Stomp! Iitht
380 Length: Artiat: The Brothera Johnson Title: The Iude Length: 337 Artist: Quincy Jones Title:
You Don't Own Me Length: 151 Artist: Lesley Gore + LIsT of SoNCs -------- Title: Stome! Length:
380 Artist: The Brothers Johnson Title: The Dude Length: 337 Artist: Quincy Jones Title: You Don't
Own Me Artiat: Lesley Gore Expected cutput Title: The Dude.
1817 LAB Playlist output linked list Given main compl.pdf
18.17 LAB: Playlist (output linked list)
Given main(), complete the SongNode class to include the function PrintSongInfo(). Then write the
PrintPlaylist() function in main.cpp to print all songs in the playlist. DO NOT print the dummy
head node.
Ex: If the input is:
the output is:
#include "SongNode.h"
// Constructor
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = NULL;
}
// Constructor
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode*
nextLoc) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = nextLoc;
}
// insertAfter
void SongNode::InsertAfter(SongNode* nodeLoc) {
SongNode* tmpNext;
tmpNext = this->nextNodeRef;
this->nextNodeRef = nodeLoc;
nodeLoc->nextNodeRef = tmpNext;
}
// Get location pointed by nextNodeRef
SongNode* SongNode::GetNext() {
return this->nextNodeRef;
}
// TODO: Write PrintSongInfo() function
in C++ please, thank you!.
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);
}
}.
maincpp include ltiostreamgt include ltstringgt.pdf
main.cpp:
#include <iostream>
#include <string>
using namespace std;
class SongNode {
private:
string songTitle;
string songLength;
string songArtist;
SongNode* nextNodeRef;
public:
SongNode() {
songTitle = "";
songLength = "";
songArtist = "";
nextNodeRef = NULL;
}
SongNode(string songTitleInit, string songLengthInit, string songArtistInit);
SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode* nextLoc);
void InsertAfter(SongNode* nodeLoc);
SongNode* GetNext();
void PrintSongInfo();
};
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = NULL;
}
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode*
nextLoc) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = nextLoc;
}
void SongNode::InsertAfter(SongNode* nodeLoc) {
SongNode* tmpNext;
tmpNext = this->nextNodeRef;
this->nextNodeRef = nodeLoc;
nodeLoc->nextNodeRef = tmpNext;
}
SongNode* SongNode::GetNext() {
return this->nextNodeRef;
}
void SongNode::PrintSongInfo() {
cout << "Title: " << this->songTitle << endl;
cout << "Length: " << this->songLength << endl;
cout << "Artist: " << this->songArtist << endl << endl;
}
void PrintPlaylist(SongNode *song) {
song = song->GetNext();
while (song != NULL) {
song->PrintSongInfo();
song = song->GetNext();
}
}
int main() {
SongNode* headNode;
SongNode* currNode;
SongNode* lastNode;
string songTitle;
string songLength;
string songArtist;
headNode = new SongNode();
lastNode = headNode;
getline(cin, songTitle);
while (songTitle != "-1") {
getline(cin, songLength);
getline(cin, songArtist);
currNode = new SongNode(songTitle, songLength, songArtist);
lastNode->InsertAfter(currNode);
lastNode = currNode;
getline(cin, songTitle);
}
cout << "nLIST OF SONGS" << endl;
cout << "-------------" << endl;
PrintPlaylist(headNode);
return 0;
}
SongNode.h:
#include <iostream>
#include <string>
using namespace std;
class SongNode {
private:
string songTitle;
string songLength;
string songArtist;
SongNode* nextNodeRef; // Reference to the next node
public:
SongNode() {
songTitle = "";
songLength = "";
songArtist = "";
nextNodeRef = NULL;
}
// Constructor
SongNode(string songTitleInit, string songLengthInit, string songArtistInit);
// Constructor
SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode* nextLoc);
// insertAfter
void InsertAfter(SongNode* nodeLoc);
// Get location pointed by nextNodeRef
SongNode* GetNext();
// Prints song information
void PrintSongInfo();
};
// SongNode.cpp
// Constructor
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = NULL;
}
// Constructor
SongNode:.
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
}.
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)
{
.
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.
Sorting with Linked-List Write a c++ program to read a series of integ.pdf
Sorting with Linked-List
Write a c++ program to read a series of integers from the user. When End-of-File (Ctrl + D) is
encountered, the program output those numbers which have been sorted in ascending order.
For example, the input is 1 3 5 7 2 4 6, the output will be 1 2 3 4 5 6 7.
Hint: When you insert a value into a linked-list, you need not always add in the front or at the
back of the list. You may insert in a proper position.
main.cpp is given as
#include <iostream>
#include "listElement.h"
using std::cin;
ListElement*
insertToList(ListElement* pList, int v);
void printList(ListElement* p);
int main() {
ListElement* pList = NULL;
int n;
while (cin >> n) {
if (n <= 0) break;
pList = insertToList(pList, n);
}
printList(pList);
return 0;
}
printList.cpp is given as
#include <iostream>
#include "listElement.h"
void printList(ListElement* p) {
while (p != NULL) {
std::cout << p->value << ' ';
p = p->pNext;
}
std::cout << std::endl;
}
listElement.h is given as
struct ListElement {
int value; // value of an element
ListElement* pNext; // Pointer to a list element
};
Note:
You should not modify the contents of either main.cpp or printList.cpp.
All you need to do is preparing a .cpp file which contains the definition of the insertToList()
function..
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 .
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.
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)
.
In C++ please I need output please You will be building a .pdf
In C++ please I need output please
You will be building a linked list. Make sure to keep track of both the head and tail nodes.
(1) Create three files to submit.
PlaylistNode.h - Class declaration
PlaylistNode.cpp - Class definition
main.cpp - main() function
Build the PlaylistNode class per the following specifications. Note: Some functions can initially be
function stubs (empty functions), to be completed in later steps.
Default constructor (1 pt)
Parameterized constructor (1 pt)
Public member functions
InsertAfter() - Mutator (1 pt)
SetNext() - Mutator (1 pt)
GetID() - Accessor
GetSongName() - Accessor
GetArtistName() - Accessor
GetSongLength() - Accessor
GetNext() - Accessor
PrintPlaylistNode()
Private data members
string uniqueID - Initialized to "none" in default constructor
string songName - Initialized to "none" in default constructor
string artistName - Initialized to "none" in default constructor
int songLength - Initialized to 0 in default constructor
PlaylistNode* nextNodePtr - Initialized to 0 in default constructor
Ex. of PrintPlaylistNode output:
(2) In main(), prompt the user for the title of the playlist. (1 pt)
Ex:
(3) Implement the PrintMenu() function. PrintMenu() takes the playlist title as a parameter and
outputs a menu of options to manipulate the playlist. (1 pt)
Ex:
(4) Implement the ExecuteMenu() function that takes 3 parameters: a character representing the
user's choice, a playlist title, and the pointer to the head node of a playlist. ExecuteMenu()
performs the menu options (described below) according to the user's choice, and returns the
pointer to the head node of the playlist.(1 pt)
(5) In main(), call PrintMenu() and prompt for the user's choice of menu options. Each option is
represented by a single character.
If an invalid character is entered, continue to prompt for a valid choice. When a valid option is
entered, execute the option by calling ExecuteMenu() and overwrite the pointer to the head node
of the playlist with the returned pointer. Then, print the menu, and prompt for a new option.
Continue until the user enters 'q'. Hint: Implement Quit before implementing other options. (1 pt)
Ex:
(6) Implement "Output full playlist" menu option in ExecuteMenu(). If the list is empty, output:
Playlist is empty (3 pts)
Ex:
(7) Implement the "Add song" menu option in ExecuteMenu(). New additions are added to the end
of the list. (2 pts)
Ex:
(8) Implement the "Remove song" menu option in ExecuteMenu(). Prompt the user for the unique
ID of the song to be removed.(4 pts)
Ex:
(9) Implement the "Change position of song" menu option in ExecuteMenu(). Prompt the user for
the current position of the song and the desired new position. Valid new positions are 1 - n (the
number of nodes). If the user enters a new position that is less than 1, move the node to the
position 1 (the head). If the user enters a new position greater than n, move the node to position n
(the tail). 6 cases will be tested:
Moving the head node (1 pt)
.
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.
819 LAB Program Playlist c++ You will be building a li.pdf
8.19 LAB*: Program: Playlist (c++)
You will be building a linked list. Make sure to keep track of both the head and tail nodes.
(1) Create three files to submit.
PlaylistNode.h - Class declaration
PlaylistNode.cpp - Class definition
main.cpp - main() function
Build the PlaylistNode class per the following specifications. Note: Some functions can initially be
function stubs (empty functions), to be completed in later steps.
Default constructor (1 pt)
Parameterized constructor (1 pt)
Public member functions
InsertAfter() - Mutator (1 pt)
SetNext() - Mutator (1 pt)
GetID() - Accessor
GetSongName() - Accessor
GetArtistName() - Accessor
GetSongLength() - Accessor
GetNext() - Accessor
PrintPlaylistNode()
Private data members
string uniqueID - Initialized to "none" in default constructor
string songName - Initialized to "none" in default constructor
string artistName - Initialized to "none" in default constructor
int songLength - Initialized to 0 in default constructor
PlaylistNode* nextNodePtr - Initialized to 0 in default constructor
Ex. of PrintPlaylistNode output:
(2) In main(), prompt the user for the title of the playlist. (1 pt)
Ex:
(3) Implement the PrintMenu() function. PrintMenu() takes the playlist title as a parameter and
outputs a menu of options to manipulate the playlist. (1 pt)
Ex:
(4) Implement the ExecuteMenu() function that takes 3 parameters: a character representing the
user's choice, a playlist title, and the pointer to the head node of a playlist. ExecuteMenu()
performs the menu options (described below) according to the user's choice, and returns the
pointer to the head node of the playlist.(1 pt)
(5) In main(), call PrintMenu() and prompt for the user's choice of menu options. Each option is
represented by a single character.
If an invalid character is entered, continue to prompt for a valid choice. When a valid option is
entered, execute the option by calling ExecuteMenu() and overwrite the pointer to the head node
of the playlist with the returned pointer. Then, print the menu, and prompt for a new option.
Continue until the user enters 'q'. Hint: Implement Quit before implementing other options. (1 pt)
Ex:
(6) Implement "Output full playlist" menu option in ExecuteMenu(). If the list is empty, output:
Playlist is empty (3 pts)
Ex:
(7) Implement the "Add song" menu option in ExecuteMenu(). New additions are added to the end
of the list. (2 pts)
Ex:
(8) Implement the "Remove song" menu option in ExecuteMenu(). Prompt the user for the unique
ID of the song to be removed.(4 pts)
Ex:
(9) Implement the "Change position of song" menu option in ExecuteMenu(). Prompt the user for
the current position of the song and the desired new position. Valid new positions are 1 - n (the
number of nodes). If the user enters a new position that is less than 1, move the node to the
position 1 (the head). If the user enters a new position greater than n, move the node to position n
(the tail). 6 cases will be tested:
Moving the head node (1 pt)
.
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.
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 ...
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.
Many of us have large digital music collections that are not always .pdf
Many of us have large digital music collections that are not always very well organized. It would
be nice to have a program that would manipulate our music collection based on attributes such as
artist, album title, song title, genre, song length, number times played, and rating. For this
assignment you will write a basic digital music manager (DMM).
Your DMM program must have a text-based interface which allows the user to select from a
mainmenu of options including: (1) load, (2) store, (3) display, (4) insert, (5) delete, (6) edit, (7)
sort, (8) rate, (9) play, (10) shuffle, and (11) exit. For Part I of the assignment, you will only need
to complete the main menu, (1) load, (2) store, (3) display, (6) edit, (8) rate, (9) play, and (11)
exit features. The other features will be completed in the next part of the assignment.
What must the main menu contain?
The main menu must display the following commands:
(1) load
(2) store
(3) display
(4) insert
(5) delete
(6) edit
(7) sort
(8) rate
(9) play
(10) shuffle
(11) exit
After a command is selected and completed, your program must display the main menu again.
This procedure will continue until the “exit” command is selected.
What must “load” do?
The “load” command must read all records from a file called musicPlayList.csv (you may find a
sample file here) into a dynamic doubly linked list. The doubly linked list is considered the main
playlist. As each record is read from the file, it must be inserted at the front of the list. Each
record consists of the following attributes:
Each attribute, in a single record, will be separated by a comma in the .csv (comma separated
values) file. This means that you will need to design an algorithm to extract the required
attributes for each record. Each field in each record will have a value. You do not need to check
for null or empty values.
You must define a struct called Record to represent the above attributes. Also, do not forget that
the Song Length must be represented by another struct called Duration. Duration is defined as
follows:
Finally, each struct Node in the doubly linked list must be defined as follows:
What must “store” do?
The “store” command writes the current records, in the dynamic doubly linked list, to the
musicPlayList.csv file. The store will completely overwrite the previous contents in the file.
What must “display” do?
The “display” command prints records to the screen. This command must support two methods,
one of which is selected by the user:
Print all records.
Print all records that match an artist.
What must “edit” do?
The “edit” command must allow the user to find a record in the list by artist. If there are multiple
records with the same artist, then your program must prompt the user which one to edit. The user
may modify all of the attributes in the record.
What must “rate” do?
The “rate” command must allow the user to assign a value of 1 – 5 to a song; 1 is the lowest
rating and 5 is the highest rating. The rating will repla.
BeepComp - Chiptune Creator - User's Guide (v0.2.2)
User's manual for BeepComp Chiptune Creator software for windows. This document is for version 0.2.2. http://hiromorozumi.com/beepcomp
In C++ Plz LAB Artwork label classesconstructors Given m.pdf
Imagine that you are an American sports apparel manufacturer thinking of expansion. You
currently sell your product through licensed agreements with a third-party vendor in the United
Kingdom and Canada. You are thinking of expanding to another country and have whittled the list
down to two countries: Australia and Spain.
Using Ghemwat's CAGE framework, illustrate which country you believe would be most
advantageous, considering the relative distance both nations have to the United States..
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.
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..
C++ Programming Search A Linked ListThe Content of songlist.txt.pdf
C++ Programming: Search A Linked List
The Content of \"songlist.txt\": Problem 2: Write a C++ program that searches the playlist (the
linked list) for a certain song. There are two functions to be implemented. searchSong ByTitl e
and searchSongByArtist. searchSongBy Title will search by song title and print the songs that
have the title searchSongBy Artist will search by song artist and print the songs that are sung by
the artist. Both functions do not need to return the song pointer and they can have a void return
type.
Solution
#include
#include
#include
#include
using namespace std;
int main(){
vector slist;
string line1[30];
int choice;
string artist,title;
ifstream myfile(\"songlist.txt\");
int a = 0;
if(!myfile)
{
cout<<\"Error opening the output file\"<>choice;
if(choice==1){
cout<<\"\ Please enter the title of the song:\";
getline (std::cin,title);
for(int i=0;i.
QUESTION If you look at the code, youll see that we keep two list.pdf
QUESTION: If you look at the code, you\'ll see that we keep two lists, one to print the text in
forward order, and one to print the text in reverse order. The forward one is using our empty
add() function, so nothing gets put into it. You\'ll fix that, as well as modifiying insert() and
erase(). The reverse on works by inserting always at the head of the list, like a Stack.Functions
insert(), erase(), and add() must be modified so that if the last node of the list changes, List::last
must change, as well. YOU JUST HAVE TO COMPLETE THE LIST.CPP FILE SO THAT IT
PRINTS THE OUTPUT IN THE FORWARD ORDER.FINISH THE CODE ONLY IN
LIST.CPP FILE AND OTHER FILES ARE JUST FOR REFERENCE. MORE
INFORMATION AND HINTS ARE GIVEN IN THE COMMENTS IN LIST.CPP FILE.
HINT: AFTER the existing code runs, there\'s an easy way to know if you just changed the last
node in the list; if you did, it\'s time to update the \"last\" pointer. And remember that \'add\'-ing
the first item is a special case. We could make a Linked List behave a lot like a Queue if it were
really efficient to add a node at the end of the list, that is, without having to chase links from the
head to the tail. So we will add another pointer to our List class that will always point at the last
item in the list. Read the existing code carefully and understand how it works. The \"add\"
function is now empty. If you run the file you should get an output that starts out like this:
?CURRENT LIST.CPP:
CURRENT OUTPUT:
MAIN.CPP FILE:
LIST.H FILE: include list include
Solution
PROGRAM CODE:
/*
* List.cpp
*
* Created on: 29-Nov-2016
* Author: kasturi
*/
#include \"List.h\"
#include
#include
#include
using namespace std;
void List::insert(ElemetType item, int position)
{
Node * predptr = first;
for(int i=1; i< position && predptr && predptr->next; i++)
{
predptr = predptr->next;
}
Node * newptr = new Node;
newptr->payload = item;
if(!predptr)
{
newptr->next = 0;
first = newptr;
}
else if(position == 0)
{
newptr->next = first;
first = newptr;
}
else
{
newptr->next = predptr->next;
predptr->next = newptr;
}
}
void List::erase(int position)
{
Node * predptr = first;
for(int i=1; inext; i++)
{
predptr = predptr->next;
}
if(!predptr)
{
}
else if(position == 1)
{
first = predptr->next;
delete predptr;
}
else
{
Node *ptr = predptr->next;
predptr->next = ptr->next;
delete ptr;
}
}
void List::display(ostream& ostr)
{
Node * ptr = last; //changed the display function to print the first
while(ptr)
{
ostr<payload<next;
}
}
List::List()
{
first = 0;
last = 0;
}
List::~List()
{
while(first)
{
Node *nxt = first->next;
delete first;
first = nxt;
}
}
void List::add(ElemetType item)
{
//added code to add values into the last node
Node * predptr = last;
Node *newptr = new Node;
newptr->payload= item;
while( predptr && predptr->next)
{
predptr = predptr->next;
}
if(!predptr)
{
newptr->next = 0;
last = newptr;
}
else
{
newptr->next = predptr->next;
predptr->next = newptr;
}
}
OUTPUT:
Forward:
The
quick
brown
fox
jumped
over
the
back.
In c++ Polymorphism is one of the hallmarks of OOP languages- What are (1).pdf
In c++ Polymorphism is one of the hallmarks of OOP languages. What are the benefits of
polymorphism? Does it come with a cost? What are the costs? explai? please don't send old
answers..
In Chapter 4 of LS- there is a case of Zappos and it describes how Zap.pdf
In Chapter 4 of LS, there is a case of Zappos and it describes how Zappos ran their experiment in
the market. Please describe how Zappos did that, and include a summary of the 3 items that
Zappos did during their experiment that were a result of Zappos 'building a product, albeit a
simple one.'.
More Related Content
Similar to In C++ Plz LAB- Playlist (output linked list) Given main()- complete.pdf
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.
Sorting with Linked-List Write a c++ program to read a series of integ.pdf
Sorting with Linked-List
Write a c++ program to read a series of integers from the user. When End-of-File (Ctrl + D) is
encountered, the program output those numbers which have been sorted in ascending order.
For example, the input is 1 3 5 7 2 4 6, the output will be 1 2 3 4 5 6 7.
Hint: When you insert a value into a linked-list, you need not always add in the front or at the
back of the list. You may insert in a proper position.
main.cpp is given as
#include <iostream>
#include "listElement.h"
using std::cin;
ListElement*
insertToList(ListElement* pList, int v);
void printList(ListElement* p);
int main() {
ListElement* pList = NULL;
int n;
while (cin >> n) {
if (n <= 0) break;
pList = insertToList(pList, n);
}
printList(pList);
return 0;
}
printList.cpp is given as
#include <iostream>
#include "listElement.h"
void printList(ListElement* p) {
while (p != NULL) {
std::cout << p->value << ' ';
p = p->pNext;
}
std::cout << std::endl;
}
listElement.h is given as
struct ListElement {
int value; // value of an element
ListElement* pNext; // Pointer to a list element
};
Note:
You should not modify the contents of either main.cpp or printList.cpp.
All you need to do is preparing a .cpp file which contains the definition of the insertToList()
function..
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 .
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.
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)
.
In C++ please I need output please You will be building a .pdf
In C++ please I need output please
You will be building a linked list. Make sure to keep track of both the head and tail nodes.
(1) Create three files to submit.
PlaylistNode.h - Class declaration
PlaylistNode.cpp - Class definition
main.cpp - main() function
Build the PlaylistNode class per the following specifications. Note: Some functions can initially be
function stubs (empty functions), to be completed in later steps.
Default constructor (1 pt)
Parameterized constructor (1 pt)
Public member functions
InsertAfter() - Mutator (1 pt)
SetNext() - Mutator (1 pt)
GetID() - Accessor
GetSongName() - Accessor
GetArtistName() - Accessor
GetSongLength() - Accessor
GetNext() - Accessor
PrintPlaylistNode()
Private data members
string uniqueID - Initialized to "none" in default constructor
string songName - Initialized to "none" in default constructor
string artistName - Initialized to "none" in default constructor
int songLength - Initialized to 0 in default constructor
PlaylistNode* nextNodePtr - Initialized to 0 in default constructor
Ex. of PrintPlaylistNode output:
(2) In main(), prompt the user for the title of the playlist. (1 pt)
Ex:
(3) Implement the PrintMenu() function. PrintMenu() takes the playlist title as a parameter and
outputs a menu of options to manipulate the playlist. (1 pt)
Ex:
(4) Implement the ExecuteMenu() function that takes 3 parameters: a character representing the
user's choice, a playlist title, and the pointer to the head node of a playlist. ExecuteMenu()
performs the menu options (described below) according to the user's choice, and returns the
pointer to the head node of the playlist.(1 pt)
(5) In main(), call PrintMenu() and prompt for the user's choice of menu options. Each option is
represented by a single character.
If an invalid character is entered, continue to prompt for a valid choice. When a valid option is
entered, execute the option by calling ExecuteMenu() and overwrite the pointer to the head node
of the playlist with the returned pointer. Then, print the menu, and prompt for a new option.
Continue until the user enters 'q'. Hint: Implement Quit before implementing other options. (1 pt)
Ex:
(6) Implement "Output full playlist" menu option in ExecuteMenu(). If the list is empty, output:
Playlist is empty (3 pts)
Ex:
(7) Implement the "Add song" menu option in ExecuteMenu(). New additions are added to the end
of the list. (2 pts)
Ex:
(8) Implement the "Remove song" menu option in ExecuteMenu(). Prompt the user for the unique
ID of the song to be removed.(4 pts)
Ex:
(9) Implement the "Change position of song" menu option in ExecuteMenu(). Prompt the user for
the current position of the song and the desired new position. Valid new positions are 1 - n (the
number of nodes). If the user enters a new position that is less than 1, move the node to the
position 1 (the head). If the user enters a new position greater than n, move the node to position n
(the tail). 6 cases will be tested:
Moving the head node (1 pt)
.
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.
819 LAB Program Playlist c++ You will be building a li.pdf
8.19 LAB*: Program: Playlist (c++)
You will be building a linked list. Make sure to keep track of both the head and tail nodes.
(1) Create three files to submit.
PlaylistNode.h - Class declaration
PlaylistNode.cpp - Class definition
main.cpp - main() function
Build the PlaylistNode class per the following specifications. Note: Some functions can initially be
function stubs (empty functions), to be completed in later steps.
Default constructor (1 pt)
Parameterized constructor (1 pt)
Public member functions
InsertAfter() - Mutator (1 pt)
SetNext() - Mutator (1 pt)
GetID() - Accessor
GetSongName() - Accessor
GetArtistName() - Accessor
GetSongLength() - Accessor
GetNext() - Accessor
PrintPlaylistNode()
Private data members
string uniqueID - Initialized to "none" in default constructor
string songName - Initialized to "none" in default constructor
string artistName - Initialized to "none" in default constructor
int songLength - Initialized to 0 in default constructor
PlaylistNode* nextNodePtr - Initialized to 0 in default constructor
Ex. of PrintPlaylistNode output:
(2) In main(), prompt the user for the title of the playlist. (1 pt)
Ex:
(3) Implement the PrintMenu() function. PrintMenu() takes the playlist title as a parameter and
outputs a menu of options to manipulate the playlist. (1 pt)
Ex:
(4) Implement the ExecuteMenu() function that takes 3 parameters: a character representing the
user's choice, a playlist title, and the pointer to the head node of a playlist. ExecuteMenu()
performs the menu options (described below) according to the user's choice, and returns the
pointer to the head node of the playlist.(1 pt)
(5) In main(), call PrintMenu() and prompt for the user's choice of menu options. Each option is
represented by a single character.
If an invalid character is entered, continue to prompt for a valid choice. When a valid option is
entered, execute the option by calling ExecuteMenu() and overwrite the pointer to the head node
of the playlist with the returned pointer. Then, print the menu, and prompt for a new option.
Continue until the user enters 'q'. Hint: Implement Quit before implementing other options. (1 pt)
Ex:
(6) Implement "Output full playlist" menu option in ExecuteMenu(). If the list is empty, output:
Playlist is empty (3 pts)
Ex:
(7) Implement the "Add song" menu option in ExecuteMenu(). New additions are added to the end
of the list. (2 pts)
Ex:
(8) Implement the "Remove song" menu option in ExecuteMenu(). Prompt the user for the unique
ID of the song to be removed.(4 pts)
Ex:
(9) Implement the "Change position of song" menu option in ExecuteMenu(). Prompt the user for
the current position of the song and the desired new position. Valid new positions are 1 - n (the
number of nodes). If the user enters a new position that is less than 1, move the node to the
position 1 (the head). If the user enters a new position greater than n, move the node to position n
(the tail). 6 cases will be tested:
Moving the head node (1 pt)
.
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.
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 ...
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.
Many of us have large digital music collections that are not always .pdf
Many of us have large digital music collections that are not always very well organized. It would
be nice to have a program that would manipulate our music collection based on attributes such as
artist, album title, song title, genre, song length, number times played, and rating. For this
assignment you will write a basic digital music manager (DMM).
Your DMM program must have a text-based interface which allows the user to select from a
mainmenu of options including: (1) load, (2) store, (3) display, (4) insert, (5) delete, (6) edit, (7)
sort, (8) rate, (9) play, (10) shuffle, and (11) exit. For Part I of the assignment, you will only need
to complete the main menu, (1) load, (2) store, (3) display, (6) edit, (8) rate, (9) play, and (11)
exit features. The other features will be completed in the next part of the assignment.
What must the main menu contain?
The main menu must display the following commands:
(1) load
(2) store
(3) display
(4) insert
(5) delete
(6) edit
(7) sort
(8) rate
(9) play
(10) shuffle
(11) exit
After a command is selected and completed, your program must display the main menu again.
This procedure will continue until the “exit” command is selected.
What must “load” do?
The “load” command must read all records from a file called musicPlayList.csv (you may find a
sample file here) into a dynamic doubly linked list. The doubly linked list is considered the main
playlist. As each record is read from the file, it must be inserted at the front of the list. Each
record consists of the following attributes:
Each attribute, in a single record, will be separated by a comma in the .csv (comma separated
values) file. This means that you will need to design an algorithm to extract the required
attributes for each record. Each field in each record will have a value. You do not need to check
for null or empty values.
You must define a struct called Record to represent the above attributes. Also, do not forget that
the Song Length must be represented by another struct called Duration. Duration is defined as
follows:
Finally, each struct Node in the doubly linked list must be defined as follows:
What must “store” do?
The “store” command writes the current records, in the dynamic doubly linked list, to the
musicPlayList.csv file. The store will completely overwrite the previous contents in the file.
What must “display” do?
The “display” command prints records to the screen. This command must support two methods,
one of which is selected by the user:
Print all records.
Print all records that match an artist.
What must “edit” do?
The “edit” command must allow the user to find a record in the list by artist. If there are multiple
records with the same artist, then your program must prompt the user which one to edit. The user
may modify all of the attributes in the record.
What must “rate” do?
The “rate” command must allow the user to assign a value of 1 – 5 to a song; 1 is the lowest
rating and 5 is the highest rating. The rating will repla.
BeepComp - Chiptune Creator - User's Guide (v0.2.2)
User's manual for BeepComp Chiptune Creator software for windows. This document is for version 0.2.2. http://hiromorozumi.com/beepcomp
In C++ Plz LAB Artwork label classesconstructors Given m.pdf
Imagine that you are an American sports apparel manufacturer thinking of expansion. You
currently sell your product through licensed agreements with a third-party vendor in the United
Kingdom and Canada. You are thinking of expanding to another country and have whittled the list
down to two countries: Australia and Spain.
Using Ghemwat's CAGE framework, illustrate which country you believe would be most
advantageous, considering the relative distance both nations have to the United States..
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.
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..
C++ Programming Search A Linked ListThe Content of songlist.txt.pdf
C++ Programming: Search A Linked List
The Content of \"songlist.txt\": Problem 2: Write a C++ program that searches the playlist (the
linked list) for a certain song. There are two functions to be implemented. searchSong ByTitl e
and searchSongByArtist. searchSongBy Title will search by song title and print the songs that
have the title searchSongBy Artist will search by song artist and print the songs that are sung by
the artist. Both functions do not need to return the song pointer and they can have a void return
type.
Solution
#include
#include
#include
#include
using namespace std;
int main(){
vector slist;
string line1[30];
int choice;
string artist,title;
ifstream myfile(\"songlist.txt\");
int a = 0;
if(!myfile)
{
cout<<\"Error opening the output file\"<>choice;
if(choice==1){
cout<<\"\ Please enter the title of the song:\";
getline (std::cin,title);
for(int i=0;i.
QUESTION If you look at the code, youll see that we keep two list.pdf
QUESTION: If you look at the code, you\'ll see that we keep two lists, one to print the text in
forward order, and one to print the text in reverse order. The forward one is using our empty
add() function, so nothing gets put into it. You\'ll fix that, as well as modifiying insert() and
erase(). The reverse on works by inserting always at the head of the list, like a Stack.Functions
insert(), erase(), and add() must be modified so that if the last node of the list changes, List::last
must change, as well. YOU JUST HAVE TO COMPLETE THE LIST.CPP FILE SO THAT IT
PRINTS THE OUTPUT IN THE FORWARD ORDER.FINISH THE CODE ONLY IN
LIST.CPP FILE AND OTHER FILES ARE JUST FOR REFERENCE. MORE
INFORMATION AND HINTS ARE GIVEN IN THE COMMENTS IN LIST.CPP FILE.
HINT: AFTER the existing code runs, there\'s an easy way to know if you just changed the last
node in the list; if you did, it\'s time to update the \"last\" pointer. And remember that \'add\'-ing
the first item is a special case. We could make a Linked List behave a lot like a Queue if it were
really efficient to add a node at the end of the list, that is, without having to chase links from the
head to the tail. So we will add another pointer to our List class that will always point at the last
item in the list. Read the existing code carefully and understand how it works. The \"add\"
function is now empty. If you run the file you should get an output that starts out like this:
?CURRENT LIST.CPP:
CURRENT OUTPUT:
MAIN.CPP FILE:
LIST.H FILE: include list include
Solution
PROGRAM CODE:
/*
* List.cpp
*
* Created on: 29-Nov-2016
* Author: kasturi
*/
#include \"List.h\"
#include
#include
#include
using namespace std;
void List::insert(ElemetType item, int position)
{
Node * predptr = first;
for(int i=1; i< position && predptr && predptr->next; i++)
{
predptr = predptr->next;
}
Node * newptr = new Node;
newptr->payload = item;
if(!predptr)
{
newptr->next = 0;
first = newptr;
}
else if(position == 0)
{
newptr->next = first;
first = newptr;
}
else
{
newptr->next = predptr->next;
predptr->next = newptr;
}
}
void List::erase(int position)
{
Node * predptr = first;
for(int i=1; inext; i++)
{
predptr = predptr->next;
}
if(!predptr)
{
}
else if(position == 1)
{
first = predptr->next;
delete predptr;
}
else
{
Node *ptr = predptr->next;
predptr->next = ptr->next;
delete ptr;
}
}
void List::display(ostream& ostr)
{
Node * ptr = last; //changed the display function to print the first
while(ptr)
{
ostr<payload<next;
}
}
List::List()
{
first = 0;
last = 0;
}
List::~List()
{
while(first)
{
Node *nxt = first->next;
delete first;
first = nxt;
}
}
void List::add(ElemetType item)
{
//added code to add values into the last node
Node * predptr = last;
Node *newptr = new Node;
newptr->payload= item;
while( predptr && predptr->next)
{
predptr = predptr->next;
}
if(!predptr)
{
newptr->next = 0;
last = newptr;
}
else
{
newptr->next = predptr->next;
predptr->next = newptr;
}
}
OUTPUT:
Forward:
The
quick
brown
fox
jumped
over
the
back.
Similar to In C++ Plz LAB- Playlist (output linked list) Given main()- complete.pdf (20)
PFB cpp code for the given problem#include iostream #include .pdf
PFB cpp code for the given problem#include iostream #include .pdf
Sorting with Linked-List Write a c++ program to read a series of integ.pdf
Sorting with Linked-List Write a c++ program to read a series of integ.pdf
Program 02 Based on the previous problem you should impleme.pdf
Program 02 Based on the previous problem you should impleme.pdf
Can someone please help me complete the add_song function .pdf
Can someone please help me complete the add_song function .pdf
Can someone please help me implement the addSong function .pdf
Can someone please help me implement the addSong function .pdf
In C++ please I need output please You will be building a .pdf
In C++ please I need output please You will be building a .pdf
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
819 LAB Program Playlist c++ You will be building a li.pdf
819 LAB Program Playlist c++ You will be building a li.pdf
Hi,Please find the Ansswer below.PLAYLIST.h#include iostrea.pdf
Hi,Please find the Ansswer below.PLAYLIST.h#include iostrea.pdf
8.8 Program Playlist (Java)You will be building a linked list. Ma.pdf
8.8 Program Playlist (Java)You will be building a linked list. Ma.pdf
lab03build.bat@echo offclsset DRIVE_LETTER=1set.docx
lab03build.bat@echo offclsset DRIVE_LETTER=1set.docx
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
Many of us have large digital music collections that are not always .pdf
Many of us have large digital music collections that are not always .pdf
BeepComp - Chiptune Creator - User's Guide (v0.2.2)
BeepComp - Chiptune Creator - User's Guide (v0.2.2)
In C++ Plz LAB Artwork label classesconstructors Given m.pdf
In C++ Plz LAB Artwork label classesconstructors Given m.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
C++ Programming Search A Linked ListThe Content of songlist.txt.pdf
C++ Programming Search A Linked ListThe Content of songlist.txt.pdf
QUESTION If you look at the code, youll see that we keep two list.pdf
QUESTION If you look at the code, youll see that we keep two list.pdf
More from shreeaadithyaacellso
In c++ Polymorphism is one of the hallmarks of OOP languages- What are (1).pdf
In c++ Polymorphism is one of the hallmarks of OOP languages. What are the benefits of
polymorphism? Does it come with a cost? What are the costs? explai? please don't send old
answers..
In Chapter 4 of LS- there is a case of Zappos and it describes how Zap.pdf
In Chapter 4 of LS, there is a case of Zappos and it describes how Zappos ran their experiment in
the market. Please describe how Zappos did that, and include a summary of the 3 items that
Zappos did during their experiment that were a result of Zappos 'building a product, albeit a
simple one.'.
In C Programming- not C++ Write a function which takes two formal pa.pdf
In C Programming, not C++
Write a function which takes two formal parameters, an array of "int" and the length of the array
as an "int". This function will iterate over the array and set the value at every index to be the
square of the current value at that index.
Use the following function signature:
void squareAll(int numbers[], int length).
In chapter 17 you learned about the big picture of circulation through.pdf
In chapter 17 you learned about the big picture of circulation through the pulmonary and
systemic routes, and how the right and left heart function in those routes. You also learned that
systemic routes go to all of the organs/tissues in the body. One of those organs is the heart wall
muscle (myocardium). Route blood from inside the right atrium (the start of the pulmonary
circuit) to the coronary sinus (the end of the systemic circuit that serves heart wall tissue). Your
route must include all heart chambers and valves..
In cell M11- enter a formula that will calculate the total amount due.pdf
In cell M11, enter a formula that will calculate the total amount due after discounts have been
applied. Incorporate an IFERROR function to return a blank value ("' ) if formula returns an
error. Format the result as Accounting and copy the formula down through M34..
In C++ Complete the program with the bold requirements #include #i.pdf
In C++ Complete the program with the bold requirements #include #include #include using
namespace std; int main () { list L1; list L2 (4,100); list L3 (L2.begin(),L2.end()); list L4 (L3);
L1.push_back(12); L1.push_back(21); cout << "Content of L1 is "; for (list ::iterator it =
L1.begin(); it != L1.end(); it++) cout << *it << ' '; cout << '\n'; /* - insert 2 new elements in list
L1, in front - print content of L1 */ L1.pop_back(); /* - print content of L1 */ /* - print list L2 -
merge sort on L2 with L3, then with L4 (join the elements of L2 with L3, then with L4-sorted) -
print list L2 */ int vInt[] = {16,2,77,29}; list L5 (vInt, vInt + sizeof(vInt) / sizeof(int) ); cout <<
"Content of L5 is "; for (list ::iterator it = L5.begin(); it != L5.end(); it++) cout << *it << ' '; cout
<< '\n'; return 0; }.
I am studying for a test tomorrow in my 494 Population Biology class-.pdf
I am studying for a test tomorrow in my 494 Population Biology class. Could someone
explain exactly how delta N/ delta t is different from dN/dt? My professor they differ but
didn't really explain how. Thank you.
I got the codes written down below- Basically- I am trying to implemen.pdf
I got the codes written down below. Basically, I am trying to implement OOP of employees and
payments with LinkedList, but when I test it, I keep getting errors like "uncleared Identifier."
Please help me with my programs.(Language: C)
The above images are the expected output and graphic illustrations of the linked lists.
Please help me debug the program and provide the correct version of the codes. DO NOT COPY
others' answers or chatGPT, and then, I'll give you an upvote.
Main:
///////////////////////////////////////////////////////////////////////////////////////////////////
#include "employee.h"
int main(){
//-----------------------------------------------------
//testCase -1
/*
EMPLOYEE e;
e.name="james";
e.id=123456;
e.next=NULL;
e.payments=NULL;
printEmployee(e);
*/
//-----------------------------------------------------
//testCase -2
/*
PAYMENT p1;
p1.date="01/01/2010";
p1.amount=150;
p1.next=NULL;
PAYMENT p2;
p2.date="01/05/2010";
p2.amount=200;
p2.next=&p1;
EMPLOYEE e;
e.name="sarah";
e.id=123456;
e.payments=&p2;
e.next=NULL;
printEmployee(e);
*/
//-----------------------------------------------------
//testCase -3
/*
addEmployee(123,"alma");
addEmployee(456,"mike");
printEmployees();
*/
//-----------------------------------------------------
//testCase -4
/*
addEmployee(123,"alma");
addPayment(123,"01/02/2020",3000);
addPayment(123,"10/07/2021",5000);
printEmployees();
*/
//-----------------------------------------------------
//testCase -5
/*
addEmployee(123,"alma");
addPayment(123,"01/02/2020",3000);
addPayment(123,"10/07/2021",5000);
addEmployee(456,"mike");
addPayment(456,"06/03/2020",700);
addPayment(456,"07/02/2020",200);
addPayment(456,"06/04/2021",600);
printEmployees();
*/
//-----------------------------------------------------
//testCase -6
/*
addEmployee(123,"alma");
addPayment(123,"01/02/2020",3000);
addPayment(123,"10/07/2021",5000);
addEmployee(456,"mike");
addPayment(456,"06/03/2020",700);
addPayment(456,"07/02/2020",200);
addPayment(456,"06/04/2021",600);
deleteEmployee(123,"alma");
printEmployees();
*/
//-----------------------------------------------------
//testCase -7
/*
addEmployee(123,"alma");
addPayment(123,"01/02/2020",3000);
addPayment(123,"10/07/2021",5000);
addEmployee(456,"mike");
addPayment(456,"06/03/2020",700);
addPayment(456,"07/02/2020",200);
addPayment(456,"06/04/2021",600);
deleteEmployee(456,"mike");
deleteEmployee(123,"alma");
printEmployees();
*/
}
///////////////////////////////////////////////////////////////////////////////////////////////////
Constructor:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct payment{
char* date; // MM/DD/YY as text
float amount;
struct payment* next;
}PAYMENT;
typedef struct employee{
int id;
char* name;
PAYMENT* payments;
struct employee* next;
}EMPLOYEE;
void printEmployee(EMPLOYEE e);
void printEmployees();
void addEmployee(int e_id,char* e_name);
int addPayment(int e_id, char* p_date, float p_amount);
int deleteEmployee(int e_id, char.
I am trying to write a program that will converts a 32bit float number.pdf
I am trying to write a program that will converts a 32bit float number's binary representation into
a 64bit one. I understand how I would need to expand the exponent by using the bias etc. But I
have no idea how to expand the significand(matissa frac) value. I fundamentally don't understand
how we calculate the binary representation of the significand(frac) portion of a float's binary
representation..
I am stuck on this question- please show the solution step by step- Re.pdf
I am stuck on this question, please show the solution step by step:
Recursion Tree
Draw the recursion tree on the following, identify the per-level sum, the shortest and longest path
from root to the leaf, and solve the recurrence equation
T(n) = T(n/5) + T(4n/5) + 5n.
I et X and Y he two indenendent R(3n-1-3) random variables- Calculate.pdf
I et X and Y he two indenendent R ( 3 n .1/3 ) random variables. Calculate.
I am working on a coding project- and it asked me to combine five sets.pdf
I am working on a coding project, and it asked me to combine five sets of data, then keep a
certain amount of the columns, then add one. (This is all being done in Python) What is the
correct formula, through Python, to get those columns?
For example, the question is to combine five data sets, keep nine columns but add one..
I am needing to do a Point Factor Job Evaluation for a IT Company whos.pdf
I am needing to do a Point Factor Job Evaluation for a IT Company whose main goals are
customer service, response time and dependability.
My compensable factors are:
Skills (Education / knowledge, experience)
Responsibilities ( responsive, degree of independent work/supervision)
Efforts (dependability, customer service)
Please help me come up with definitions for each of these compensable factors: Education /
knowledge, experience, responsive, degree of independent work/supervision, dependability,
customer service.
i cant figure out this excel equation For the Year Ended December 31-.pdf
i cant figure out this excel equation
For the Year Ended December 31, 2023 Capital December 31, prior year niau investments by
owner Net income Less: Withdrawals by owner jital December 31 current year.
I am writing a program that will allow the user to move the crosshairs.pdf
I am writing a program that will allow the user to move the crosshairs with the mouse I am
having trouble getting the crosshairs to move using function moveCrosshairs(e). Can you help
and explain how to do this? Thank you. Here is my code:
/*This program will allow the user to use the mouse to draw crosshairs that follow the mouse*/
let hLine;
let vLine;
function main(){
drawCrosshairs();
mouseMoveMethod(moveCrosshairs);
}
/*initializes crosshairs through center of the canvas before the user moves mouse*/
function drawCrosshairs(){
//draw horizontal line
hlLine = new Line(0,getHeight()/2,getWidth(),getHeight()/2);
hLine.setColor("black");
hLine.setLineWidth(2);
add(hLine);
//draw vertical line
vLine = new Line(getWidth()/2,0, getWidth()/2,getHeight());
vLine.setColor("black");
vLine.setLineWidth(2);
add(vLine);
}
function moveCrosshairs(e){
hlLine.setPosition(0,e.getY());
hLine.setEndpoint(getWidth(),e.getY();
vLine.setPosition(e.getX(),0);
vLine.setPostion(e.getX(),get(Height());
}
main();
.
I need simple java code for the below scenario- UML Diagrams(Class-Use.pdf
I need simple java code for the below scenario.
UML Diagrams(Class,Use Case, Sequence, Object)
BPO Management System
PROBLEM STATEMENT: With the reduction in communication costs and improved
bandwidths and associated infrastructure, BPO as a segment is witnessing a massive growth. One
of the key challenges that BPO companies that provide data entry/data validation services is an
efficient and effective way of getting the source documents from different customers and
accurately route the same to different operators for processing. The customer has to register to
get the service from BPO systems. The BPO management system use cases are: Search for
client/job
1. Negotiate the project
2. Upload input data
3. Perform required conversion
4. Quality Check
5. Shipment
6. Payment
Write plagiarism free code for the above using Java. Evaluations will be based on the following:
1. UML diagrams (class, object, use case and sequence diagram)
2. Registration module
3. Services provided to the customer details module
4. Get the payment from the customer module
5. Main program, the application which integrates the above packages..
I need hlep I have posted this proble 4 times have gotten no help can.pdf
I need hlep I have posted this proble 4 times have gotten no help can come re write my code so
that It works
//import statemnts for Random, Scanner and IO
import java.util.Random;
import java.util.Scanner;
import java.io.*;
public class Hobbits
{
public static void main(String[] args) throws IOException
{
final int NUM_HOBBITS = 5;
final int NUM_COLUMNS = 2;
String fileName = "hobbits.csv";
//call populateHobbits() to create the two-dimensional array
double[][] hobbits = populateHobbits(NUM_HOBBITS, NUM_COLUMNS);
//display the number of hobbits
System.out.println(hobbits.length + " hobbits accepted Gandalf's invitation to lunch\n");
//calculate the means of the columns
double[] hobbitMeans = getColMeans(hobbits);
//write hobbits array to file
writeHobbits(hobbits, fileName);
//read and display the file that has been read
readHobbitses(fileName);
//call displayColMeans to display hobbit means
displayColMeans(hobbitMeans);
}
//method to populate hobbits array with random double values
public static double[][] populateHobbits(int numHobbits, int numCols) {
final double HT_MULTIPLIER = 10.0; //multiplier for the hobbit height
final double WT_MULTIPLIER = 250.0; //multiplier for the hobbit weight
//instantiate Random object
Random rand = new Random();
//declare two-dim array with numHobbits rows numCols columns
double[][] hobbitArray = new double[numHobbits][numCols];
//assign random double values to all elements
for (int i = 0; i < numHobbits; i++) //outer loop is for rows
{
for (int j = 0; j < numCols; j++) //inner loop is for columns
{
//get a random double value in range [0.2, 0.4]
double randDouble = getRandDouble(rand);
//assign this double to the current array element
hobbitArray[i][j] = randDouble;
//determine which multiplier to use
if (j == 0) //this is column for height
hobbitArray[i][j] *= HT_MULTIPLIER;
else //this is column for weight
hobbitArray[i][j] *= WT_MULTIPLIER;
}
}
return hobbitArray; //return the two-dimensional array
}
//method to write hobbits array to file
public static void writeHobbits(double[][] ar, String fileName) throws IOException
{
PrintWriter outFile = new PrintWriter(new FileWriter(fileName));
//print column heading of the array of stats
outFile.println("HEIGHT,WEIGHT");
for (int i = 0; i < ar.length; i++) {
for (int j = 0; j < ar[i].length; j++)
{
outFile.print(ar[i][j]);
//if at end of a row, add newline char
if (j == ar[i].length - 1)
outFile.print("\n");
else //add the "," delimiter
outFile.print(",");
} //end of inner loop
} //end of outer loop
outFile.close(); //close outfile
System.out.println("The file was successfully written\n");
} //end of method
//method to reads the hobbits file
public static void readHobbitses(String fileName) throws IOException {
//open the file to read
File dataFile = new File(fileName);
Scanner inFile = new Scanner(dataFile);
//variable to contain the substrings of one line of file
String[] oneLine = new String[2];
int counter = 0; //keep track of line numbers
System.out.printl.
I need question 1 answer in java language- question 1)Create an applic.pdf
I need question 1 answer in java language.
question 1)Create an application that will maintain a list of your classmates using a singly
Linked List. The application should be able to add and remove classmates. Assume that requests
to add or remove classmates from the list will come with the index at which to add or remove
them..
I need help with this question- Thank you! Problem -#1- (5pts) - Nutri.pdf
I need help with this question. Thank you!
Problem \#1. (5pts) - Nutrient limitation Aerosols generated from local forest fires are deposited
in the surface waters of a nearby oligotrophic nutrient limited (note, Synechoccocus produces
organic matter, but no biominerals). a. Based on the Redfield Ratio, will nitrate or phosphate
availability ultimately limit the bloom?.
I need help with this question- My professor gave me a zero the first.pdf
I need help with this question. My professor gave me a zero the first time. They gave me a
second chance. If you can also draw an image, that would be great. I am a visual learner.
b. What type of T cell in the lymph nodes will be activated? (1 point). c. Briefly describe the two
general events (or cellular processes) that occur upon activation of T cells. (1 point). d. The
activated T cells will leave the lymph node and migrate to the site of infection (respiratory tract).
Upon finding S . pneumoniae infected host cells, how do the T cells eliminate the infection? (1
point)..
More from shreeaadithyaacellso (20)
In c++ Polymorphism is one of the hallmarks of OOP languages- What are (1).pdf
In c++ Polymorphism is one of the hallmarks of OOP languages- What are (1).pdf
In Chapter 4 of LS- there is a case of Zappos and it describes how Zap.pdf
In Chapter 4 of LS- there is a case of Zappos and it describes how Zap.pdf
In C Programming- not C++ Write a function which takes two formal pa.pdf
In C Programming- not C++ Write a function which takes two formal pa.pdf
In chapter 17 you learned about the big picture of circulation through.pdf
In chapter 17 you learned about the big picture of circulation through.pdf
In cell M11- enter a formula that will calculate the total amount due.pdf
In cell M11- enter a formula that will calculate the total amount due.pdf
In C++ Complete the program with the bold requirements #include #i.pdf
In C++ Complete the program with the bold requirements #include #i.pdf
I am studying for a test tomorrow in my 494 Population Biology class-.pdf
I am studying for a test tomorrow in my 494 Population Biology class-.pdf
I got the codes written down below- Basically- I am trying to implemen.pdf
I got the codes written down below- Basically- I am trying to implemen.pdf
I am trying to write a program that will converts a 32bit float number.pdf
I am trying to write a program that will converts a 32bit float number.pdf
I am stuck on this question- please show the solution step by step- Re.pdf
I am stuck on this question- please show the solution step by step- Re.pdf
I et X and Y he two indenendent R(3n-1-3) random variables- Calculate.pdf
I et X and Y he two indenendent R(3n-1-3) random variables- Calculate.pdf
I am working on a coding project- and it asked me to combine five sets.pdf
I am working on a coding project- and it asked me to combine five sets.pdf
I am needing to do a Point Factor Job Evaluation for a IT Company whos.pdf
I am needing to do a Point Factor Job Evaluation for a IT Company whos.pdf
i cant figure out this excel equation For the Year Ended December 31-.pdf
i cant figure out this excel equation For the Year Ended December 31-.pdf
I am writing a program that will allow the user to move the crosshairs.pdf
I am writing a program that will allow the user to move the crosshairs.pdf
I need simple java code for the below scenario- UML Diagrams(Class-Use.pdf
I need simple java code for the below scenario- UML Diagrams(Class-Use.pdf
I need hlep I have posted this proble 4 times have gotten no help can.pdf
I need hlep I have posted this proble 4 times have gotten no help can.pdf
I need question 1 answer in java language- question 1)Create an applic.pdf
I need question 1 answer in java language- question 1)Create an applic.pdf
I need help with this question- Thank you! Problem -#1- (5pts) - Nutri.pdf
I need help with this question- Thank you! Problem -#1- (5pts) - Nutri.pdf
I need help with this question- My professor gave me a zero the first.pdf
I need help with this question- My professor gave me a zero the first.pdf
Recently uploaded
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.
2024.06.01 Introducing a competency framework for languag learning materials ...
http://sandymillin.wordpress.com/iateflwebinar2024
Published classroom materials form the basis of syllabuses, drive teacher professional development, and have a potentially huge influence on learners, teachers and education systems. All teachers also create their own materials, whether a few sentences on a blackboard, a highly-structured fully-realised online course, or anything in between. Despite this, the knowledge and skills needed to create effective language learning materials are rarely part of teacher training, and are mostly learnt by trial and error.
Knowledge and skills frameworks, generally called competency frameworks, for ELT teachers, trainers and managers have existed for a few years now. However, until I created one for my MA dissertation, there wasn’t one drawing together what we need to know and do to be able to effectively produce language learning materials.
This webinar will introduce you to my framework, highlighting the key competencies I identified from my research. It will also show how anybody involved in language teaching (any language, not just English!), teacher training, managing schools or developing language learning materials can benefit from using the framework.
Home assignment II on Spectroscopy 2024 Answers.pdf
Answers to Home assignment on UV-Visible spectroscopy: Calculation of wavelength of UV-Visible absorption
Digital Tools and AI for Teaching Learning and Research
This Presentation in details discusses on Digital Tools and AI for Teaching Learning and Research
special B.ed 2nd year old paper_20240531.pdf
Instagram:-
https://instagram.com/special_education_needs_01?igshid=YmMyMTA2M2Y=
WhatsApp:-
https://chat.whatsapp.com/JVakNIYlSV94x7bwunO3Dc
YouTube:-
https://youtube.com/@special_education_needs
Teligram :- https://t.me/special_education_needs
Slide Shere :-
https://www.slideshare.net/shabnambano20?utm_campaign=profiletracking&utm_medium=sssite&utm_source=ssslideview
Operation Blue Star - Saka Neela Tara
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...Nguyen Thanh Tu Collection
https://app.box.com/s/hqnndn05v4q5a4k4jd597rkdbda0fniiChapter 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.Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Event Link:-
https://meetups.mulesoft.com/events/details/mulesoft-mysore-presents-exploring-gemini-ai-and-integration-with-mulesoft/
Agenda
● Java 17 Upgrade Overview
● Why and by when do customers need to upgrade to Java 17?
● Is there any immediate impact to upgrading to Mule Runtime 4.6 and beyond?
● Which MuleSoft products are in scope?
For Upcoming Meetups Join Mysore Meetup Group - https://meetups.mulesoft.com/mysore/
YouTube:- youtube.com/@mulesoftmysore
Mysore WhatsApp group:- https://chat.whatsapp.com/EhqtHtCC75vCAX7gaO842N
Speaker:-
Shubham Chaurasia - https://www.linkedin.com/in/shubhamchaurasia1/
Priya Shaw - https://www.linkedin.com/in/priya-shaw
Organizers:-
Shubham Chaurasia - https://www.linkedin.com/in/shubhamchaurasia1/
Giridhar Meka - https://www.linkedin.com/in/giridharmeka
Priya Shaw - https://www.linkedin.com/in/priya-shaw
Shyam Raj Prasad-
https://www.linkedin.com/in/shyam-raj-prasad/
Synthetic Fiber Construction in lab .pptx
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
The Challenger.pdf DNHS Official Publication
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
Instructions for Submissions thorugh G- Classroom.pptx
This presentation provides a briefing on how to upload submissions and documents in Google Classroom. It was prepared as part of an orientation for new Sainik School in-service teacher trainees. As a training officer, my goal is to ensure that you are comfortable and proficient with this essential tool for managing assignments and fostering student engagement.
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
Polish students' mobility in the Czech Republic
Polish students mobility to the Czech Republic within eTwinning project "Medieval adventures with Marco Polo"
The approach at University of Liverpool.pptx
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
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
Recently uploaded (20)
2024.06.01 Introducing a competency framework for languag learning materials ...
2024.06.01 Introducing a competency framework for languag learning materials ...
Home assignment II on Spectroscopy 2024 Answers.pdf
Home assignment II on Spectroscopy 2024 Answers.pdf
Digital Tools and AI for Teaching Learning and Research
Digital Tools and AI for Teaching Learning and Research
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptx
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Adversarial Attention Modeling for Multi-dimensional Emotion Regression.pdf
Adversarial Attention Modeling for Multi-dimensional Emotion Regression.pdf
Instructions for Submissions thorugh G- Classroom.pptx
Instructions for Submissions thorugh G- Classroom.pptx
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
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...
In C++ Plz LAB- Playlist (output linked list) Given main()- complete.pdf
- 1. 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); }
- 2. // Print linked list cout << "LIST OF SONGS" << endl; cout << "-------------" << endl; PrintPlaylist(headNode); return 0; }