I just need code for processQueue function using iterators from the .pdf
•
0 likes•2 views
I just need code for processQueue function using iterators from the linkedList class. #include #include #include #include #include "Queuecpp.h" #include "Songcpp.h" #include "RequestCpp.h" void populateRequests(Queue& q); void populateSongDataBase(LinkedList &list); void processQueue(LinkedList &list,Queue& q); void processRequest(std::string action, std::string title,std::string singer,int chartPos); //GIVEN int main() { LinkedList list; Queue q; populateSongDataBase(list); // fill the Songs Data Base into Linked List std::cout<<"*************************************\n"; list.printList(); // std::cout<<"*************************************\n"; populateRequests(q); // fill the request q std::cout<<"\n"; std::cout<<"---------------PRINTING QUEUE-------------------\n"; q.printList(); std::cout<<"------------------------------------\n"; processQueue(list,q); // process the requests std::cout<<"*************************************\n"; list.printList(); std::cout<<"*************************************\n"; } //GIVEN //Requires an empty linked list //Effects fills the list with request by reading from the RequestData.txt //Modifies the queue by filling it void populateRequests(Queue &q){ } //GIVEN //Requires Filled data base , song to play //Effects Finds song using get, if found plays it //Modifies nothing std::string playSong(LinkedList&list, Song s){ if (list.get(s)>=0){ return "PLAYING :"+ s.toString()+"\n"; } else{ return "SONG NOT FOUND\n"; } } //GIVEN //Requires filled database //Effects calls print methood to print top ten songs //Modifies nothing void printTopTenSongs(LinkedList& list){ std::cout<<"PLAYING TOP TEN SONG __________\n"; list.print(10); ; } //Requires filled Song Database, a Song to add. The chart position given in the song is where it will get added. Note this is a Song that is not supposed to exist in database. //Effects adds the song from its original chart position //Modifies the Song database. Adjust chart position of all Songs affected by this addition- this adjustment is done in insert method using adjustPosition method. If the Process Queue adds a Song that already is in the database, then a duplicate entry can occur. //TODO void addThisSong(LinkedList &list, Song s){ //TODO /* Use this code if (found>=0) {std::cout<<"ADDED THIS SONG "< &list, Song s){ /* Use this code if (found>=0) {std::cout<<"SORRY CANNOT REMOVE THIS SONG - STILL FOUND AT "< &list, Song s, int pos){ int chartPos=list.get(s); std::cout<<"MOVING SONG "< &list,std::string action, std::string title,std::string singer,int chartPos){ Song s(title,singer,chartPos); char ch =action[0]; switch(ch){ case 'P' : std::cout< &list ,Queue& q){ int requestNumber=1; //Create an iterator for the Queue to iteratate through requests std::cout<<"-------------------------------------------------------------------------\n"; // call processRequest std::cout<<"-------------------------------------------------------------------------\n" std::cout<<"------------------------.
Report
Share
Report
Share
Download to read offline
Recommended
Overpsss API / Overpass-Turbo
This document provides an overview of the Overpass API and Overpass-turbo. It discusses how to set up an Overpass API instance, including compiling and installing OSM-3S, generating and updating the database, configuring Apache2, and installing Overpass-Turbo. It also provides examples of Overpass QL queries and describes capabilities like filtering, selecting related objects, and output formats.
Can someone solve the TODO parts of the following problem i.pdf
Can someone solve the TODO parts of the following problem
#include <iostream>
#include <fstream>
#include <sstream>
#include<string>
#include "Queuecpp.h"
#include "Songcpp.h"
#include "RequestCpp.h"
//GIVEN
int main() {
LinkedList<Song> list;
Queue<Request> q;
populateSongDataBase(list); // fill the Songs Data Base into Linked List
std::cout<<"*************************************n";
list.printList(); //
std::cout<<"*************************************n";
populateRequests(q); // fill the request q
std::cout<<"n";
std::cout<<"---------------PRINTING QUEUE-------------------n";
q.printList();
std::cout<<"------------------------------------n";
processQueue(list,q); // process the requests
std::cout<<"*************************************n";
list.printList();
std::cout<<"*************************************n";
}
//GIVEN
void populateRequests(Queue<Request> &q){
}
//GIVEN
std::string playSong(LinkedList<Song>&list, Song s){
}
//GIVEN
void printTopTenSongs(LinkedList<Song>& list){
}
//TODO
void addThisSong(LinkedList<Song> &list, Song s){
//TODO
/* Use this code
if (found>=0) {std::cout<<"ADDED THIS SONG "<<found+1<<" " ;list.printSong(found+1);}
else std::cout<<"SORRY CANNOT FIND SONG n";
*/
}
//TODO
void removeThisSong(LinkedList<Song> &list, Song s){
/* Use this code
if (found>=0) {std::cout<<"SORRY CANNOT REMOVE THIS SONG - STILL FOUND AT
"<<found;}
else{ std::cout<<"REMOVED THIS SONG n";
std::cout<<"THE SONG AT CHARTPOSITION "<<chartPos<<" IS NOW ";
list.printSong(chartPos); std::cout<<"n";
*/
}
}
//TODO
void moveThisSong(LinkedList<Song> &list, Song s, int pos){
int chartPos=list.get(s);
std::cout<<"MOVING SONG "<<s.toString()<<"n";
list.move(s,pos);
std::cout<<"ITS NEW CHART POSITION n";
list.printSong(pos);
std::cout<<"THE SONG AT PREVIOUS POSITION "<<chartPos+1<< " IS NOW
";list.printSong(chartPos+1);
}
//GIVEN
void processRequest(LinkedList<Song> &list,std::string action, std::string title,std::string singer,int
chartPos){
Song s(title,singer,chartPos);
char ch =action[0];
switch(ch){
case 'P' : std::cout<<playSong(list,s)<<"n";break;
case 'A' : addThisSong(list,s);break;;
case 'R' : removeThisSong(list,s);break;
case 'M' : moveThisSong(list,s,chartPos);break;
case 'T' : printTopTenSongs(list);break;
}
}
//TODO
void processQueue(LinkedList<Song> &list ,Queue<Request>& q){
int requestNumber=1;
//Create an iterator for the Queue to iteratate through requests
std::cout<<"-------------------------------------------------------------------------n";
// call processRequest
std::cout<<"-------------------------------------------------------------------------n"
std::cout<<"-------------------------------------------------------------------------n";
}
//GIVEN
void populateSongDataBase(LinkedList<Song> &list){
std::string line="";
std::string token="";
std::string title="";
std::string singer="";
int chartPos=-1;
try {
std::ifstream input("SongsData.txt");
if (input.fail())
throw new std::string("FILE OPEN ERROR EXCEPTION n");
else{
while (getli.
Please solve the TODO parts of the following probelm incl.pdf
Please solve the TODO parts of the following probelm.
#include <iostream>
#include <fstream>
#include <sstream>
#include<string>
#include "Queuecpp.h"
#include "Songcpp.h"
#include "RequestCpp.h"
void populateRequests(Queue<Request>& q);
void populateSongDataBase(LinkedList<Song> &list);
void processQueue(LinkedList<Song> &list,Queue<Request>& q);
void processRequest(std::string action, std::string title,std::string singer,int chartPos);
//GIVEN
int main() {
LinkedList<Song> list;
Queue<Request> q;
populateSongDataBase(list); // fill the Songs Data Base into Linked List
std::cout<<"************************************* ";
list.printList(); //
std::cout<<"************************************* ";
populateRequests(q); // fill the request q
std::cout<<" ";
std::cout<<"---------------PRINTING QUEUE------------------- ";
q.printList();
std::cout<<"------------------------------------ ";
processQueue(list,q); // process the requests
std::cout<<"************************************* ";
list.printList();
std::cout<<"************************************* ";
}
//TODO
void populateRequests(Queue<Request> &q){
}
std::string playSong(LinkedList<Song>&list, Song s){
if (list.get(s)>=0){
return "PLAYING :"+ s.toString()+" ";
}
else{
return "SONG NOT FOUND ";
}
}
//GIVEN
void printTopTenSongs(LinkedList<Song>& list){
std::cout<<"PLAYING TOP TEN SONG __________ ";
list.print(10);
}
//TODO
void addThisSong(LinkedList<Song> &list, Song s){
}
//TODO
void removeThisSong(LinkedList<Song> &list, Song s){
}
//TODO
void moveThisSong(LinkedList<Song> &list, Song s, int pos){
}
//GIVEN
void processRequest(LinkedList<Song> &list,std::string action, std::string title,std::string singer,int
chartPos){
Song s(title,singer,chartPos);
char ch =action[0];
switch(ch){
case 'P' : std::cout<<playSong(list,s)<<" ";break;
case 'A' : addThisSong(list,s);break;;
case 'R' : removeThisSong(list,s);break;
case 'M' : moveThisSong(list,s,chartPos);break;
case 'T' : printTopTenSongs(list);break;
}
}
//TODO
void processQueue(LinkedList<Song> &list ,Queue<Request>& q){
int requestNumber=1;
//Create an iterator for the Queue to iteratate through requests
std::cout<<"------------------------------------------------------------------------- ";
// call processRequest
std::cout<<"------------------------------------------------------------------------- "
std::cout<<"------------------------------------------------------------------------- ";
}
//TODO
void populateSongDataBase(LinkedList<Song> &list){
}
#include "Queue.h"
//template <class T>
//Queue<T>::Queue(){
// back=nullptr;
//}
template <class T>
//TODO
// add an element t to the end queue
// this should be an O(1) operation
void Queue<T>::add(T t){
}
//TODO
//remove an element from the front of the queue
// this should be an O(1) operation
template <class T>
void Queue<T>::remove(){
//TODO
// if queue us empty
// throw new std::string("NULL POINTER EXCEPTION QUEUE IS EMPTY ");
}
#include "ListNode.h"
#include<iostream>
template <class T>
Li.
2 BytesC++ course_2014_c3_ function basics¶meters and overloading
The document discusses functions in C++. It explains that functions can be defined in two ways: with declaration/calling/definition or with just declaration and definition. It provides examples of declaring a function that calculates the average of two numbers, calling that function, and defining the function. It also discusses local and global variables and their scopes. Finally, it lists some common predefined functions in C++ like sqrt, pow, abs, and rand.
Router Queue Simulation in C++ in MMNN and MM1 conditions
The document describes modifications made to a queue simulation program to measure the average time packets spend in the system. It is modified to track the arrival and departure time of each packet. When a packet arrives, its arrival time is recorded. When the packet departs, its processing time is calculated as the difference between departure and arrival time. These processing times are summed over all packets to calculate the average time spent in the system. The key code changes involve adding variables to track each packet's arrival and departure times, calculate processing time, and sum times across all packets.
Start with the inclusion of libraries#include iostream .docx
// Start with the inclusion of libraries
#include <iostream> //The library of io functions
#include <fstream> //The library of external stream functions
#include <cstdlib> //The library for external errors
#include <string> //The library for string functions
#include <cmath> //The library of C math functions
#include <iomanip> //Allows setting widths, etc. for I/O
#include <stdlib.h>
#include <stdio.h>
#include<vector>
using namespace std;
// Define all of the prototypes for functions used in the program
// Counts the number of unique letters seen
int countunique(int *array, int size);
// Creates the input file and formats it for use by the cipher section.
void createinput(string ifile, string ofile);
// Creates the encoded input file
void createcipher(int key, string ifile, string ofile);
// Finds and counts the number of digrams
int digram(int *pointer, string ifile);
// Counts the letter frequency in the encoded input file
int lettercount(int*, string ifile, string ofile);
// Finds the highest count in the singlton (or any other) array
int singleton(int*, int size);
// Trims an input file to the right size starting at an offset
void trimfile(string ifile, string ofile, int offset, int size);
// Begin the main function for testing
int main(int argc, char* argv[])
{
int count = 0;
int second = 0;
int singlefreq[26];
int *single = singlefreq;
int delta;
int loop; //The loop counter for arguments
int final = 0;
int totalcnt;
int key = -1; //Sets the key value
int len = 0; //The length to investigate for testing
int off; //Holds the offset into the file
double m; //Holds the metric error value
char loopletter;
float percent;
string ifile1 = "";
string ofile1 = "";
string deflt = "c:\\dissertation\\ShiftandSubcipherC++files\\clean.txt";
string ifile2 = "";
string ofile2 = ""; //Holds selected file path names
string cmdarg; //Holds the command line argument
string stop = "l"; //Gives the stop condition, assumes l
string reportfile = "c:\\dissertation\\test\\report.txt";
ofstream outs; //Declare an output stream for reporting
int digramc[676]; //Set up the digram array
int *two = digramc; //Point to the digram array
int dicount = 0; //Holds the count of the number of digrams
int total = 0; //Counts the total number of letters seen for analysis
for (loop = 1; loop<argc; loop++) //Decide if we have arguments or must use defaults
{
if (!argv[1])
{
// cout << "No argument found.\n";
ifile1 = deflt;
}
else
{
cmdarg = argv[loop];
if (cmdarg == "-k")
{
loop++;
key = atoi(argv[loop]);
cout << "key = " << key << endl;
}
if (cmdarg == "-l")
{
loop++;
len = atoi(argv[loop]);
cout << "Run for " << len << " characters.\n";
}
if (cmdarg == "-m")
{
loop++;
m = atof(argv[loop]);
cout << "Run until and error of " << m << "\n";
}
if (cmdarg == "-off")
{
loop++;
off = atoi(argv[loop]);
cout << ...
I need help with implementing the priority queue data structure with a.docx
I need help with implementing the priority queue data structure with a linked list implementation and with modifying my code with a template. Make sure that the code has the required methods to get the given test code in driver.cpp to work properly. I will provide the main cpp file and what I have so far below. The code is in C++. Add comments to where you modified the code, so I know what you did to change it. Thank you.
//////////////////////// driver.cpp /////////////////////////////
#include <iostream>
#include <string>
#include "stackLL.h"
#include "queueLL.h"
#include "priorityQueueLL.h"
using namespace std;
int main()
{
/////////////Test code for stack ///////////////
stackLL stk;
stk.push(5);
stk.push(13);
stk.push(7);
stk.push(3);
stk.push(2);
stk.push(11);
cout << "Popping: " << stk.pop() << endl;
cout << "Popping: " << stk.pop() << endl;
stk.push(17);
stk.push(19);
stk.push(23);
while (!stk.empty())
{
cout << "Popping: " << stk.pop() << endl;
}
// output order: 11,2,23,19,17,3,7,13,5
stackLL stkx;
stkx.push(5);
stkx.push(10);
stkx.push(15);
stkx.push(20);
stkx.push(25);
stkx.push(30);
stkx.insertAt(-100, 3);
stkx.insertAt(-200, 7);
stkx.insertAt(-300, 0);
//output order: -300,30,25,20,-100,15,10,5,-200
while (!stkx.empty())
cout << "Popping: " << stkx.pop() << endl;
///////////////////////////////////////
//////////Test code for queue ///////////
queueLL Q;
Q.enqueue(1);
Q.enqueue(2);
Q.enqueue(3);
cout << "Dequeuing: " << Q.dequeue() << endl; //1
cout << "Dequeuing: " << Q.dequeue() << endl; //2
Q.enqueue(4);
Q.enqueue(5);
//3 4 5
while (!Q.empty())
{
cout << "Dequeuing: " << Q.dequeue() << endl;
}
/////////////////////////////////////////
//////////Test code for priority queue/////
priorityQueueLL<int> pQueue;
const int SIZE = 20;
//insert a bunch of random numbers
for (int i = 0; i < SIZE; i++)
{
pQueue.insert(rand());
}
//pull them back out..
//They must come out in order from smallest to largest
while (!pQueue.empty())
{
cout << pQueue.extractMin() << endl;
}
priorityQueueLL<string> pqs;
pqs.insert("whale");
pqs.insert("snake");
pqs.insert("buffalo");
pqs.insert("elmo");
pqs.insert("fire");
pqs.insert("waffle");
//buffalo elmo fire snake waffle whale
while (!pqs.empty())
{
cout << pqs.extractMin() << endl;
}
///////////////////////////////////////////
//1) Template your queue class
//2) Add a decimate method to your queue class
queueLL<int> qx;
for (int i = 1; i <= 100; i++)
qx.enqueue(i);
//Eliminate every 10th item from list
//https://en.wikipedia.org/wiki/Decimation_(punishment)
qx.decimate();
//1 2 3 4 5 6 7 8 9 11 12 13 14 15 16 17 18 19 21 22... 98 99
while (!qx.empty())
cout << qx.dequeue() << endl;
queueLL<string> qy;
qy.enqueue("sparticus");
qy.enqueue("maximus");
qy.enqueue("killicus");
qy.enqueue("awesomeicus");
qy.enqueue("gannicus");
qy.enqueue("varro");
qy.enqueue("oenomous");
qy.enqueue("slayicus");
qy.enqueue("bladeicus");
qy.enqueue("ted.
Basicsof c make and git for a hello qt application
This document provides an overview of using CMake and Git for a Hello World application in C, Qt, and managing source code with Git. It demonstrates how to configure CMake files to compile Hello World programs in C and Qt. It also summarizes basic Git commands like init, add, commit, branch, merge, and rebase. Useful online resources for learning more about CMake, Qt, and Git are provided.
Recommended
Overpsss API / Overpass-Turbo
This document provides an overview of the Overpass API and Overpass-turbo. It discusses how to set up an Overpass API instance, including compiling and installing OSM-3S, generating and updating the database, configuring Apache2, and installing Overpass-Turbo. It also provides examples of Overpass QL queries and describes capabilities like filtering, selecting related objects, and output formats.
Can someone solve the TODO parts of the following problem i.pdf
Can someone solve the TODO parts of the following problem
#include <iostream>
#include <fstream>
#include <sstream>
#include<string>
#include "Queuecpp.h"
#include "Songcpp.h"
#include "RequestCpp.h"
//GIVEN
int main() {
LinkedList<Song> list;
Queue<Request> q;
populateSongDataBase(list); // fill the Songs Data Base into Linked List
std::cout<<"*************************************n";
list.printList(); //
std::cout<<"*************************************n";
populateRequests(q); // fill the request q
std::cout<<"n";
std::cout<<"---------------PRINTING QUEUE-------------------n";
q.printList();
std::cout<<"------------------------------------n";
processQueue(list,q); // process the requests
std::cout<<"*************************************n";
list.printList();
std::cout<<"*************************************n";
}
//GIVEN
void populateRequests(Queue<Request> &q){
}
//GIVEN
std::string playSong(LinkedList<Song>&list, Song s){
}
//GIVEN
void printTopTenSongs(LinkedList<Song>& list){
}
//TODO
void addThisSong(LinkedList<Song> &list, Song s){
//TODO
/* Use this code
if (found>=0) {std::cout<<"ADDED THIS SONG "<<found+1<<" " ;list.printSong(found+1);}
else std::cout<<"SORRY CANNOT FIND SONG n";
*/
}
//TODO
void removeThisSong(LinkedList<Song> &list, Song s){
/* Use this code
if (found>=0) {std::cout<<"SORRY CANNOT REMOVE THIS SONG - STILL FOUND AT
"<<found;}
else{ std::cout<<"REMOVED THIS SONG n";
std::cout<<"THE SONG AT CHARTPOSITION "<<chartPos<<" IS NOW ";
list.printSong(chartPos); std::cout<<"n";
*/
}
}
//TODO
void moveThisSong(LinkedList<Song> &list, Song s, int pos){
int chartPos=list.get(s);
std::cout<<"MOVING SONG "<<s.toString()<<"n";
list.move(s,pos);
std::cout<<"ITS NEW CHART POSITION n";
list.printSong(pos);
std::cout<<"THE SONG AT PREVIOUS POSITION "<<chartPos+1<< " IS NOW
";list.printSong(chartPos+1);
}
//GIVEN
void processRequest(LinkedList<Song> &list,std::string action, std::string title,std::string singer,int
chartPos){
Song s(title,singer,chartPos);
char ch =action[0];
switch(ch){
case 'P' : std::cout<<playSong(list,s)<<"n";break;
case 'A' : addThisSong(list,s);break;;
case 'R' : removeThisSong(list,s);break;
case 'M' : moveThisSong(list,s,chartPos);break;
case 'T' : printTopTenSongs(list);break;
}
}
//TODO
void processQueue(LinkedList<Song> &list ,Queue<Request>& q){
int requestNumber=1;
//Create an iterator for the Queue to iteratate through requests
std::cout<<"-------------------------------------------------------------------------n";
// call processRequest
std::cout<<"-------------------------------------------------------------------------n"
std::cout<<"-------------------------------------------------------------------------n";
}
//GIVEN
void populateSongDataBase(LinkedList<Song> &list){
std::string line="";
std::string token="";
std::string title="";
std::string singer="";
int chartPos=-1;
try {
std::ifstream input("SongsData.txt");
if (input.fail())
throw new std::string("FILE OPEN ERROR EXCEPTION n");
else{
while (getli.
Please solve the TODO parts of the following probelm incl.pdf
Please solve the TODO parts of the following probelm.
#include <iostream>
#include <fstream>
#include <sstream>
#include<string>
#include "Queuecpp.h"
#include "Songcpp.h"
#include "RequestCpp.h"
void populateRequests(Queue<Request>& q);
void populateSongDataBase(LinkedList<Song> &list);
void processQueue(LinkedList<Song> &list,Queue<Request>& q);
void processRequest(std::string action, std::string title,std::string singer,int chartPos);
//GIVEN
int main() {
LinkedList<Song> list;
Queue<Request> q;
populateSongDataBase(list); // fill the Songs Data Base into Linked List
std::cout<<"************************************* ";
list.printList(); //
std::cout<<"************************************* ";
populateRequests(q); // fill the request q
std::cout<<" ";
std::cout<<"---------------PRINTING QUEUE------------------- ";
q.printList();
std::cout<<"------------------------------------ ";
processQueue(list,q); // process the requests
std::cout<<"************************************* ";
list.printList();
std::cout<<"************************************* ";
}
//TODO
void populateRequests(Queue<Request> &q){
}
std::string playSong(LinkedList<Song>&list, Song s){
if (list.get(s)>=0){
return "PLAYING :"+ s.toString()+" ";
}
else{
return "SONG NOT FOUND ";
}
}
//GIVEN
void printTopTenSongs(LinkedList<Song>& list){
std::cout<<"PLAYING TOP TEN SONG __________ ";
list.print(10);
}
//TODO
void addThisSong(LinkedList<Song> &list, Song s){
}
//TODO
void removeThisSong(LinkedList<Song> &list, Song s){
}
//TODO
void moveThisSong(LinkedList<Song> &list, Song s, int pos){
}
//GIVEN
void processRequest(LinkedList<Song> &list,std::string action, std::string title,std::string singer,int
chartPos){
Song s(title,singer,chartPos);
char ch =action[0];
switch(ch){
case 'P' : std::cout<<playSong(list,s)<<" ";break;
case 'A' : addThisSong(list,s);break;;
case 'R' : removeThisSong(list,s);break;
case 'M' : moveThisSong(list,s,chartPos);break;
case 'T' : printTopTenSongs(list);break;
}
}
//TODO
void processQueue(LinkedList<Song> &list ,Queue<Request>& q){
int requestNumber=1;
//Create an iterator for the Queue to iteratate through requests
std::cout<<"------------------------------------------------------------------------- ";
// call processRequest
std::cout<<"------------------------------------------------------------------------- "
std::cout<<"------------------------------------------------------------------------- ";
}
//TODO
void populateSongDataBase(LinkedList<Song> &list){
}
#include "Queue.h"
//template <class T>
//Queue<T>::Queue(){
// back=nullptr;
//}
template <class T>
//TODO
// add an element t to the end queue
// this should be an O(1) operation
void Queue<T>::add(T t){
}
//TODO
//remove an element from the front of the queue
// this should be an O(1) operation
template <class T>
void Queue<T>::remove(){
//TODO
// if queue us empty
// throw new std::string("NULL POINTER EXCEPTION QUEUE IS EMPTY ");
}
#include "ListNode.h"
#include<iostream>
template <class T>
Li.
2 BytesC++ course_2014_c3_ function basics¶meters and overloading
The document discusses functions in C++. It explains that functions can be defined in two ways: with declaration/calling/definition or with just declaration and definition. It provides examples of declaring a function that calculates the average of two numbers, calling that function, and defining the function. It also discusses local and global variables and their scopes. Finally, it lists some common predefined functions in C++ like sqrt, pow, abs, and rand.
Router Queue Simulation in C++ in MMNN and MM1 conditions
The document describes modifications made to a queue simulation program to measure the average time packets spend in the system. It is modified to track the arrival and departure time of each packet. When a packet arrives, its arrival time is recorded. When the packet departs, its processing time is calculated as the difference between departure and arrival time. These processing times are summed over all packets to calculate the average time spent in the system. The key code changes involve adding variables to track each packet's arrival and departure times, calculate processing time, and sum times across all packets.
Start with the inclusion of libraries#include iostream .docx
// Start with the inclusion of libraries
#include <iostream> //The library of io functions
#include <fstream> //The library of external stream functions
#include <cstdlib> //The library for external errors
#include <string> //The library for string functions
#include <cmath> //The library of C math functions
#include <iomanip> //Allows setting widths, etc. for I/O
#include <stdlib.h>
#include <stdio.h>
#include<vector>
using namespace std;
// Define all of the prototypes for functions used in the program
// Counts the number of unique letters seen
int countunique(int *array, int size);
// Creates the input file and formats it for use by the cipher section.
void createinput(string ifile, string ofile);
// Creates the encoded input file
void createcipher(int key, string ifile, string ofile);
// Finds and counts the number of digrams
int digram(int *pointer, string ifile);
// Counts the letter frequency in the encoded input file
int lettercount(int*, string ifile, string ofile);
// Finds the highest count in the singlton (or any other) array
int singleton(int*, int size);
// Trims an input file to the right size starting at an offset
void trimfile(string ifile, string ofile, int offset, int size);
// Begin the main function for testing
int main(int argc, char* argv[])
{
int count = 0;
int second = 0;
int singlefreq[26];
int *single = singlefreq;
int delta;
int loop; //The loop counter for arguments
int final = 0;
int totalcnt;
int key = -1; //Sets the key value
int len = 0; //The length to investigate for testing
int off; //Holds the offset into the file
double m; //Holds the metric error value
char loopletter;
float percent;
string ifile1 = "";
string ofile1 = "";
string deflt = "c:\\dissertation\\ShiftandSubcipherC++files\\clean.txt";
string ifile2 = "";
string ofile2 = ""; //Holds selected file path names
string cmdarg; //Holds the command line argument
string stop = "l"; //Gives the stop condition, assumes l
string reportfile = "c:\\dissertation\\test\\report.txt";
ofstream outs; //Declare an output stream for reporting
int digramc[676]; //Set up the digram array
int *two = digramc; //Point to the digram array
int dicount = 0; //Holds the count of the number of digrams
int total = 0; //Counts the total number of letters seen for analysis
for (loop = 1; loop<argc; loop++) //Decide if we have arguments or must use defaults
{
if (!argv[1])
{
// cout << "No argument found.\n";
ifile1 = deflt;
}
else
{
cmdarg = argv[loop];
if (cmdarg == "-k")
{
loop++;
key = atoi(argv[loop]);
cout << "key = " << key << endl;
}
if (cmdarg == "-l")
{
loop++;
len = atoi(argv[loop]);
cout << "Run for " << len << " characters.\n";
}
if (cmdarg == "-m")
{
loop++;
m = atof(argv[loop]);
cout << "Run until and error of " << m << "\n";
}
if (cmdarg == "-off")
{
loop++;
off = atoi(argv[loop]);
cout << ...
I need help with implementing the priority queue data structure with a.docx
I need help with implementing the priority queue data structure with a linked list implementation and with modifying my code with a template. Make sure that the code has the required methods to get the given test code in driver.cpp to work properly. I will provide the main cpp file and what I have so far below. The code is in C++. Add comments to where you modified the code, so I know what you did to change it. Thank you.
//////////////////////// driver.cpp /////////////////////////////
#include <iostream>
#include <string>
#include "stackLL.h"
#include "queueLL.h"
#include "priorityQueueLL.h"
using namespace std;
int main()
{
/////////////Test code for stack ///////////////
stackLL stk;
stk.push(5);
stk.push(13);
stk.push(7);
stk.push(3);
stk.push(2);
stk.push(11);
cout << "Popping: " << stk.pop() << endl;
cout << "Popping: " << stk.pop() << endl;
stk.push(17);
stk.push(19);
stk.push(23);
while (!stk.empty())
{
cout << "Popping: " << stk.pop() << endl;
}
// output order: 11,2,23,19,17,3,7,13,5
stackLL stkx;
stkx.push(5);
stkx.push(10);
stkx.push(15);
stkx.push(20);
stkx.push(25);
stkx.push(30);
stkx.insertAt(-100, 3);
stkx.insertAt(-200, 7);
stkx.insertAt(-300, 0);
//output order: -300,30,25,20,-100,15,10,5,-200
while (!stkx.empty())
cout << "Popping: " << stkx.pop() << endl;
///////////////////////////////////////
//////////Test code for queue ///////////
queueLL Q;
Q.enqueue(1);
Q.enqueue(2);
Q.enqueue(3);
cout << "Dequeuing: " << Q.dequeue() << endl; //1
cout << "Dequeuing: " << Q.dequeue() << endl; //2
Q.enqueue(4);
Q.enqueue(5);
//3 4 5
while (!Q.empty())
{
cout << "Dequeuing: " << Q.dequeue() << endl;
}
/////////////////////////////////////////
//////////Test code for priority queue/////
priorityQueueLL<int> pQueue;
const int SIZE = 20;
//insert a bunch of random numbers
for (int i = 0; i < SIZE; i++)
{
pQueue.insert(rand());
}
//pull them back out..
//They must come out in order from smallest to largest
while (!pQueue.empty())
{
cout << pQueue.extractMin() << endl;
}
priorityQueueLL<string> pqs;
pqs.insert("whale");
pqs.insert("snake");
pqs.insert("buffalo");
pqs.insert("elmo");
pqs.insert("fire");
pqs.insert("waffle");
//buffalo elmo fire snake waffle whale
while (!pqs.empty())
{
cout << pqs.extractMin() << endl;
}
///////////////////////////////////////////
//1) Template your queue class
//2) Add a decimate method to your queue class
queueLL<int> qx;
for (int i = 1; i <= 100; i++)
qx.enqueue(i);
//Eliminate every 10th item from list
//https://en.wikipedia.org/wiki/Decimation_(punishment)
qx.decimate();
//1 2 3 4 5 6 7 8 9 11 12 13 14 15 16 17 18 19 21 22... 98 99
while (!qx.empty())
cout << qx.dequeue() << endl;
queueLL<string> qy;
qy.enqueue("sparticus");
qy.enqueue("maximus");
qy.enqueue("killicus");
qy.enqueue("awesomeicus");
qy.enqueue("gannicus");
qy.enqueue("varro");
qy.enqueue("oenomous");
qy.enqueue("slayicus");
qy.enqueue("bladeicus");
qy.enqueue("ted.
Basicsof c make and git for a hello qt application
This document provides an overview of using CMake and Git for a Hello World application in C, Qt, and managing source code with Git. It demonstrates how to configure CMake files to compile Hello World programs in C and Qt. It also summarizes basic Git commands like init, add, commit, branch, merge, and rebase. Useful online resources for learning more about CMake, Qt, and Git are provided.
prog-03.pdfCSci 430 Programming Project #3Deadlock De.docx
prog-03.pdf
CSci 430: Programming Project #3
Deadlock Detection
Spring 2019
Dates:
Assigned: Monday February 25, 2019
Due: Wednesday March 13, 2019 (before Midnight)
Objectives:
ˆ Learn more about Deadlock algorithms.
ˆ Better understand how we can algorithmically detect deadlocks on a
system.
ˆ Use C/C++ to implement vector and matrix data structures, get prac-
tice in creating and using such data structures in C/C++.
Description:
Our textbook gives the following algorithm (pg. 276) for algorithmically
detecting if a deadlock is present or not in a system. It requires that the
system keep an Allocation matrix A, listing which resources are currently
allocated to which processes, and the available vector V, which gives the
amount of each resource currently available in the system. In addition, the
deadlock detection algorithm requies a request matrix Q, which keeps track
of the amount of each resource each process is currently requesting from the
system. The algorithm is:
1. Mark each process that has a row in the Allocation matrix of all zeros.
2. Initialize a temporary vector W to equal the Available vector A.
1
3. Find an index i such that process i is currently unmarked and the i th
row of Q is less than or equal toW. That is, Qik ≤ Wk, for 1 ≤ k ≤ m.
If no such row is found, terminate the algorithm.
4. If such a row is found, mark process i and add the corresponding row of
the allocation matrix toW. That is, setWk = Wk+Aik, for 1 ≤ k ≤ m.
Return to step 3.
A deadlock exists if and only if there are unmarked processes at the end
of the algorithm. Each unmarked process is deadlocked.
In this assignment we will implement the deadlock detection algorithm.
Your program will be given a �le that describes the A allocation matrix
and the Q request matrix, representing the current state of all allocations
and requested allocations in the system. Your program will implement the
deadlock detection algorithm described above. The result of your program
will be one of 2 outputs:
1. If no deadlock exists, the program will display No Deadlock on stan-
dard output.
2. If a deadlock does exist, the program will display Deadlock: P0, P1,
P2 on standard output, where P0, P1, P2 are the processes that the
algorithm determined to be deadlocked in the system.
State simulation �le formats
I have provided a p3-start.cpp template that can open up and read in the
process/resource state simulation �les used for this assignment. Here we
discuss a bit more the format of these �le. I have provided 2 or 3 exam-
ple simulations, with expected correct answers, for you to use to test your
implementations with.
The input �les needed for this assignment need to contain the information
found in theV available vector and theA allocation andQ request matrices.
In the following I use r as the number of resources and p as the number of
processes. Thus the general format of the input �le is:
r p
V1 V2 V3 ... Vr
A11 A12 ... A1r
...
Ap1 Ap2 ... Apr
2 ...
RestMQ - HTTP/Redis based Message Queue
RestMQ is a message queue system based on Redis that allows storing and retrieving messages through HTTP requests. It uses Redis' data structures like lists, sets, and hashes to maintain queues and messages. Messages can be added to and received from queues using RESTful endpoints. Additional features include status monitoring, queue control, and support for protocols like JSON, Comet, and WebSockets. The core functionality is language-agnostic but implementations exist in Python and Ruby.
Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx
The document defines classes for a binary tree, tree node structure, stack, and queue. It provides function prototypes for tree operations like insertion, searching, and traversal but does not implement the function bodies. The solution implements four key tree functions - insertion, preorder, inorder and postorder traversal - by recursively traversing the tree and outputting node values. Sample output is shown for these four implemented functions.
Complete the C++ program and implement the routines that are n.docx
The document defines classes for a binary tree and tree nodes. It provides the function signatures for common tree operations like insertion, searching, and traversal but does not implement the function bodies. The solution implements the InsertIntoTree(), PrintInOrderTree(), PrintPreOrderTree(), and PrintPostOrderTree() functions to add nodes to the tree and print the tree using different traversal orders. Running the main() method constructs a sample tree and tests the implemented functions.
Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx
The document defines classes for a binary tree and tree nodes. It provides the function signatures for common tree operations like insertion, searching, and traversal but does not implement the function bodies. The solution implements the InsertIntoTree(), PrintInOrderTree(), PrintPreOrderTree(), and PrintPostOrderTree() functions to add nodes to the tree and print the tree using different traversal orders. Running the main() method constructs a sample tree and tests the implemented functions.
Complete the C++ program and implement the routines that are n.docx
The document defines classes for a binary tree and tree nodes. It provides the function signatures for common tree operations like insertion, searching, and traversal but does not implement the function bodies. The solution implements the InsertIntoTree(), PrintInOrderTree(), PrintPreOrderTree(), and PrintPostOrderTree() functions to add nodes to the tree and print the tree using different traversal orders. Running the main() test code produces the expected output printing the trees using these traversal methods.
Complete the C++ program and implement the routines that are n.docx
The document defines classes for a binary tree and tree nodes. It provides the function signatures for common tree operations like insertion, searching, and traversal but does not implement the function bodies. The solution implements the InsertIntoTree(), PrintInOrderTree(), PrintPreOrderTree(), and PrintPostOrderTree() functions to add nodes to the tree and print the tree using different traversal orders. Running the main() method constructs a sample tree and tests the implemented functions.
Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n Complete the C++ program and implement the routines that are n
Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx Complete the C++ program and implement the routines that are n.docx Complete the C++ program and implement the routines that are n.docx Complete the C++ program and implement the routines that are n.docx Complete the C++ program and implement the routines that are n.docx Complete the C++ program and implement the routines that are n.docx
PostgreSQL Portland Performance Practice Project - Database Test 2 Howto
Fourth presentation in a speaker series sponsored by the Portland State University Computer Science Department. The series covers PostgreSQL performance with an OLTP (on-line transaction processing) workload called Database Test 2 (DBT-2). This presentation is a set of examples to go along with the live presentation given on March 12, 2009.
計算機性能の限界点とその考え方
This document discusses measuring and optimizing data processing performance on CPUs and GPUs. It provides examples using Cupy, NumPy, Apache Ignite, and ROCm to perform operations and measure throughput on different hardware. Specific examples include sorting random data on CPU and GPU to compare performance, running Apache Ignite benchmarks on different CPUs, and using ROCm and PyOpenCL to leverage an AMD GPU for general-purpose computing. The document emphasizes that tightly coupling fast memory and computation is important for workloads with large data processing requirements.
FunctionalJS - May 2014 - Streams
The document discusses streams and functional programming in JavaScript. It provides three examples of using streams:
1. Playing MP3 files by piping a read stream through a decoder and speaker.
2. Creating a "sound soup" that randomly plays MP3 files from a directory every half second by piping read streams through a decoder and speaker.
3. A brief history of streams in Node.js, from the original Util.pump method to the current Streams API in versions 1-3, highlighting improvements in error handling and backpressure support.
Pycon - Python for ethical hackers
The document discusses using Python for ethical hacking and penetration testing. It provides reasons for using Python such as its ease of use, readable syntax, rich libraries, and existing tools. It then covers various Python libraries and frameworks used for tasks like reconnaissance, scanning, exploitation, and packet manipulation. Specific topics covered include file I/O, requests, sockets, scapy, and more.
Codepot - Pig i Hive: szybkie wprowadzenie / Pig and Hive crash course
Szybkie wprowadzenie do technologii Pig i Hive z ekosystemu Hadoop. Prezentacja wykonana w ramach warsztatów Codepot w dniu 29.08.2015. Prezentacja wykonana przez Radosława Stankiewicza oraz Bartłomieja Tartanusa.
Need help implementing the skeleton code below, I have provided the .pdf
I need help with this practice problem?
Execute the following coding segment and identify the errors in the program. Debug the program
and provide the correct version of the code. Hinclude int main() printf(\"%s\", isdigit(\'A\') ? \"A
is digit\" \"A is not digit\"); a : a printf(\"Inlnln\") return return e;
Solution
in range [0,9]. If it\'s not then this function returns 0.
Given program compiles successfully, compiler does not give any error.
But If the input of isdigit(\'A\') is changed then the program will always print
\"A is a digit\" or
\"A is not a digit\" .
It will not print exact value of char A.
So, correct code is given below.
#include
int main()
{
char A = \'1\';
printf(\"%c%s\",A,isdigit(A)? \" is a digit\" : \" is not a digit\");
printf(\"\ \");
A = \'B\';
printf(\"%c%s\",A,isdigit(A)? \" is a digit\" : \" is not a digit\");
printf(\"\ \");
return 0;
}
Sample Output:
1 is a digit
B is not a digit.
An Introduction to Windows PowerShell
This document provides an introduction and overview of Windows PowerShell. It discusses what PowerShell is, how it works, and how it can be used for administration tasks and extended to work with other products. The document covers PowerShell concepts like verbs, nouns, pipelines, and cmdlets. It also provides examples of using PowerShell for ad-hoc tasks and developing PowerShell scripts and cmdlets for production environments.
Part APurposeThis laboratory provides some experience work.docx
Part A:
Purpose:
This laboratory provides some experience working with the C++ programming language that has an SQL query and SQL update embedded in it.
Procedure:
Follow the instructions below.
Be sure to load the C++ to ProQueryExample code presented in the Appendix A below.
In your
ProQueryExample.cpp source file, modify the source code so that it changes the customer balance of Streaming Direct from $210.40 to $337.26. Rerun the query in step 3 above. Modify the source to return the balance of Streaming Direct to $210.40. Rerun the query in step 3 above. Print out a copy of your output.
Submit a cover sheet, a copy of your output, and the source code that you used to obtain it. Follow any additional instructions that your instructor may give you.
Appendix A
/*
* Name: ProQueryExample.cpp
*
* Description
* This source code displays a join of the invoice and
* customer tables. In addition this source code updates the Streaming
* Direct customer name to Direct Sports and then returns the name back
* to Streaming Direct.
*
* Remarks:
* Author Date Comment
* Mike Lukens 08/08/2008 initial code
*
*/
#include
#include
#include
using namespace oracle::occi;
using namespace std;
class occiIntf
{
public:
//constructor
occiIntf ( string login, string password, string dbStr )
{
//setup the environment which Oracle requires
environ = Environment::createEnvironment ( Environment::DEFAULT );
try
{
//create a connection to the database
connect = environ->createConnection ( login, password, dbStr );
}
catch ( SQLException excpt )
{
cout << "Exception thrown by createConnection" << endl;
cout << "Error code: "<< excpt.getErrorCode ( ) << endl;
cout << excpt.getMessage ( ) << endl;
system ( "pause" );
exit ( 1 );
}
}
//destructor
~occiIntf ( )
{
//make sure to clean up the connection and the environment when
//we are done!
environ->terminateConnection ( connect );
Environment::terminateEnvironment ( environ );
}
//update a field
void updateField ( string name, string id )
{
//change the customer name to/from Direct Sports in CUSTOMER table
string sqlStatmt
= "UPDATE customer SET cust_name = :x WHERE cust_id = :y";
statmt = connect->createStatement ( sqlStatmt );
try
{
//substitute the customer name and id into the SQL statement
statmt->setString ( 1, name );
statmt->setString ( 2, id );
statmt->executeUpdate ();
cout << "Update succeeded\n" << endl;
}
cat.
Complete the C++ program and implement the routines that are not .docx
The document describes a C++ program that implements a binary tree data structure with various node-related methods like insertion, searching, and traversal. It includes class definitions for the tree nodes (TreeStruct), the overall tree (Tree), and auxiliary stack and queue classes. Many methods are only declared, leaving their implementation incomplete. The main() function tests the various methods by building a sample tree and printing outputs.
Current Attempt in Progress. At December 31, 2024, Culiumber Imports .pdf
Current Attempt in Progress. At December 31, 2024, Culiumber Imports reported this
information on its balince sheet. During 2025, the compary had the following transactions related
to recelvables.
Prepare the journal ertries to record eachof these five transactions. Assume that no cash
disoounts were taken ca the collections. of accounts receivabie. (Omit cost of goods sold entries.)
(List oll debit entries before credit entries, Credit account tieles are dutomaticaliy indented when
amount is entered. Do not indent manually . If no entry is required, seiect "No Entry. for the
occount tities and enter 0 for the amounts.)
Question 2 of 4 Acopurts Receivible 4. 5. 17000 (To reinstate account previously written off)
\begin{tabular}{l} Cash \\ Accounts Receivatile \\ \hline \end{tabular} (To rocord collection of
accounts recelvable) efextbook and Media List of Accounts Attemptsi unlimited
Enter the January 1, 2025, balances in Accounts Recelvable and Alowance for Doubtful
Accounts, post the entries to the twe? accounts and determine the balances. (Aost entries in the
order of journal entries presented in the previous port.)
List of Accounts Attempts: inlimited (c) The parts of this question must be completed in order.
This part will be available when you complete the part above..
Current Attempt in Progress Waterway Company uses a periodic inventor.pdf
Current Attempt in Progress Waterway Company uses a periodic inventory system. Details for
the inventory account for the month of January, 2020 are as follows: An end of the month
(1/31/20) inventory showed that 110 units were on hand. If the company uses LIFO, what is the
value of the ending inventory? $652$572$550$616.
More Related Content
Similar to I just need code for processQueue function using iterators from the .pdf
prog-03.pdfCSci 430 Programming Project #3Deadlock De.docx
prog-03.pdf
CSci 430: Programming Project #3
Deadlock Detection
Spring 2019
Dates:
Assigned: Monday February 25, 2019
Due: Wednesday March 13, 2019 (before Midnight)
Objectives:
ˆ Learn more about Deadlock algorithms.
ˆ Better understand how we can algorithmically detect deadlocks on a
system.
ˆ Use C/C++ to implement vector and matrix data structures, get prac-
tice in creating and using such data structures in C/C++.
Description:
Our textbook gives the following algorithm (pg. 276) for algorithmically
detecting if a deadlock is present or not in a system. It requires that the
system keep an Allocation matrix A, listing which resources are currently
allocated to which processes, and the available vector V, which gives the
amount of each resource currently available in the system. In addition, the
deadlock detection algorithm requies a request matrix Q, which keeps track
of the amount of each resource each process is currently requesting from the
system. The algorithm is:
1. Mark each process that has a row in the Allocation matrix of all zeros.
2. Initialize a temporary vector W to equal the Available vector A.
1
3. Find an index i such that process i is currently unmarked and the i th
row of Q is less than or equal toW. That is, Qik ≤ Wk, for 1 ≤ k ≤ m.
If no such row is found, terminate the algorithm.
4. If such a row is found, mark process i and add the corresponding row of
the allocation matrix toW. That is, setWk = Wk+Aik, for 1 ≤ k ≤ m.
Return to step 3.
A deadlock exists if and only if there are unmarked processes at the end
of the algorithm. Each unmarked process is deadlocked.
In this assignment we will implement the deadlock detection algorithm.
Your program will be given a �le that describes the A allocation matrix
and the Q request matrix, representing the current state of all allocations
and requested allocations in the system. Your program will implement the
deadlock detection algorithm described above. The result of your program
will be one of 2 outputs:
1. If no deadlock exists, the program will display No Deadlock on stan-
dard output.
2. If a deadlock does exist, the program will display Deadlock: P0, P1,
P2 on standard output, where P0, P1, P2 are the processes that the
algorithm determined to be deadlocked in the system.
State simulation �le formats
I have provided a p3-start.cpp template that can open up and read in the
process/resource state simulation �les used for this assignment. Here we
discuss a bit more the format of these �le. I have provided 2 or 3 exam-
ple simulations, with expected correct answers, for you to use to test your
implementations with.
The input �les needed for this assignment need to contain the information
found in theV available vector and theA allocation andQ request matrices.
In the following I use r as the number of resources and p as the number of
processes. Thus the general format of the input �le is:
r p
V1 V2 V3 ... Vr
A11 A12 ... A1r
...
Ap1 Ap2 ... Apr
2 ...
RestMQ - HTTP/Redis based Message Queue
RestMQ is a message queue system based on Redis that allows storing and retrieving messages through HTTP requests. It uses Redis' data structures like lists, sets, and hashes to maintain queues and messages. Messages can be added to and received from queues using RESTful endpoints. Additional features include status monitoring, queue control, and support for protocols like JSON, Comet, and WebSockets. The core functionality is language-agnostic but implementations exist in Python and Ruby.
Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx
The document defines classes for a binary tree, tree node structure, stack, and queue. It provides function prototypes for tree operations like insertion, searching, and traversal but does not implement the function bodies. The solution implements four key tree functions - insertion, preorder, inorder and postorder traversal - by recursively traversing the tree and outputting node values. Sample output is shown for these four implemented functions.
Complete the C++ program and implement the routines that are n.docx
The document defines classes for a binary tree and tree nodes. It provides the function signatures for common tree operations like insertion, searching, and traversal but does not implement the function bodies. The solution implements the InsertIntoTree(), PrintInOrderTree(), PrintPreOrderTree(), and PrintPostOrderTree() functions to add nodes to the tree and print the tree using different traversal orders. Running the main() method constructs a sample tree and tests the implemented functions.
Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx
The document defines classes for a binary tree and tree nodes. It provides the function signatures for common tree operations like insertion, searching, and traversal but does not implement the function bodies. The solution implements the InsertIntoTree(), PrintInOrderTree(), PrintPreOrderTree(), and PrintPostOrderTree() functions to add nodes to the tree and print the tree using different traversal orders. Running the main() method constructs a sample tree and tests the implemented functions.
Complete the C++ program and implement the routines that are n.docx
The document defines classes for a binary tree and tree nodes. It provides the function signatures for common tree operations like insertion, searching, and traversal but does not implement the function bodies. The solution implements the InsertIntoTree(), PrintInOrderTree(), PrintPreOrderTree(), and PrintPostOrderTree() functions to add nodes to the tree and print the tree using different traversal orders. Running the main() test code produces the expected output printing the trees using these traversal methods.
Complete the C++ program and implement the routines that are n.docx
The document defines classes for a binary tree and tree nodes. It provides the function signatures for common tree operations like insertion, searching, and traversal but does not implement the function bodies. The solution implements the InsertIntoTree(), PrintInOrderTree(), PrintPreOrderTree(), and PrintPostOrderTree() functions to add nodes to the tree and print the tree using different traversal orders. Running the main() method constructs a sample tree and tests the implemented functions.
Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n Complete the C++ program and implement the routines that are n
Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx Complete the C++ program and implement the routines that are n.docx Complete the C++ program and implement the routines that are n.docx Complete the C++ program and implement the routines that are n.docx Complete the C++ program and implement the routines that are n.docx Complete the C++ program and implement the routines that are n.docx
PostgreSQL Portland Performance Practice Project - Database Test 2 Howto
Fourth presentation in a speaker series sponsored by the Portland State University Computer Science Department. The series covers PostgreSQL performance with an OLTP (on-line transaction processing) workload called Database Test 2 (DBT-2). This presentation is a set of examples to go along with the live presentation given on March 12, 2009.
計算機性能の限界点とその考え方
This document discusses measuring and optimizing data processing performance on CPUs and GPUs. It provides examples using Cupy, NumPy, Apache Ignite, and ROCm to perform operations and measure throughput on different hardware. Specific examples include sorting random data on CPU and GPU to compare performance, running Apache Ignite benchmarks on different CPUs, and using ROCm and PyOpenCL to leverage an AMD GPU for general-purpose computing. The document emphasizes that tightly coupling fast memory and computation is important for workloads with large data processing requirements.
FunctionalJS - May 2014 - Streams
The document discusses streams and functional programming in JavaScript. It provides three examples of using streams:
1. Playing MP3 files by piping a read stream through a decoder and speaker.
2. Creating a "sound soup" that randomly plays MP3 files from a directory every half second by piping read streams through a decoder and speaker.
3. A brief history of streams in Node.js, from the original Util.pump method to the current Streams API in versions 1-3, highlighting improvements in error handling and backpressure support.
Pycon - Python for ethical hackers
The document discusses using Python for ethical hacking and penetration testing. It provides reasons for using Python such as its ease of use, readable syntax, rich libraries, and existing tools. It then covers various Python libraries and frameworks used for tasks like reconnaissance, scanning, exploitation, and packet manipulation. Specific topics covered include file I/O, requests, sockets, scapy, and more.
Codepot - Pig i Hive: szybkie wprowadzenie / Pig and Hive crash course
Szybkie wprowadzenie do technologii Pig i Hive z ekosystemu Hadoop. Prezentacja wykonana w ramach warsztatów Codepot w dniu 29.08.2015. Prezentacja wykonana przez Radosława Stankiewicza oraz Bartłomieja Tartanusa.
Need help implementing the skeleton code below, I have provided the .pdf
I need help with this practice problem?
Execute the following coding segment and identify the errors in the program. Debug the program
and provide the correct version of the code. Hinclude int main() printf(\"%s\", isdigit(\'A\') ? \"A
is digit\" \"A is not digit\"); a : a printf(\"Inlnln\") return return e;
Solution
in range [0,9]. If it\'s not then this function returns 0.
Given program compiles successfully, compiler does not give any error.
But If the input of isdigit(\'A\') is changed then the program will always print
\"A is a digit\" or
\"A is not a digit\" .
It will not print exact value of char A.
So, correct code is given below.
#include
int main()
{
char A = \'1\';
printf(\"%c%s\",A,isdigit(A)? \" is a digit\" : \" is not a digit\");
printf(\"\ \");
A = \'B\';
printf(\"%c%s\",A,isdigit(A)? \" is a digit\" : \" is not a digit\");
printf(\"\ \");
return 0;
}
Sample Output:
1 is a digit
B is not a digit.
An Introduction to Windows PowerShell
This document provides an introduction and overview of Windows PowerShell. It discusses what PowerShell is, how it works, and how it can be used for administration tasks and extended to work with other products. The document covers PowerShell concepts like verbs, nouns, pipelines, and cmdlets. It also provides examples of using PowerShell for ad-hoc tasks and developing PowerShell scripts and cmdlets for production environments.
Part APurposeThis laboratory provides some experience work.docx
Part A:
Purpose:
This laboratory provides some experience working with the C++ programming language that has an SQL query and SQL update embedded in it.
Procedure:
Follow the instructions below.
Be sure to load the C++ to ProQueryExample code presented in the Appendix A below.
In your
ProQueryExample.cpp source file, modify the source code so that it changes the customer balance of Streaming Direct from $210.40 to $337.26. Rerun the query in step 3 above. Modify the source to return the balance of Streaming Direct to $210.40. Rerun the query in step 3 above. Print out a copy of your output.
Submit a cover sheet, a copy of your output, and the source code that you used to obtain it. Follow any additional instructions that your instructor may give you.
Appendix A
/*
* Name: ProQueryExample.cpp
*
* Description
* This source code displays a join of the invoice and
* customer tables. In addition this source code updates the Streaming
* Direct customer name to Direct Sports and then returns the name back
* to Streaming Direct.
*
* Remarks:
* Author Date Comment
* Mike Lukens 08/08/2008 initial code
*
*/
#include
#include
#include
using namespace oracle::occi;
using namespace std;
class occiIntf
{
public:
//constructor
occiIntf ( string login, string password, string dbStr )
{
//setup the environment which Oracle requires
environ = Environment::createEnvironment ( Environment::DEFAULT );
try
{
//create a connection to the database
connect = environ->createConnection ( login, password, dbStr );
}
catch ( SQLException excpt )
{
cout << "Exception thrown by createConnection" << endl;
cout << "Error code: "<< excpt.getErrorCode ( ) << endl;
cout << excpt.getMessage ( ) << endl;
system ( "pause" );
exit ( 1 );
}
}
//destructor
~occiIntf ( )
{
//make sure to clean up the connection and the environment when
//we are done!
environ->terminateConnection ( connect );
Environment::terminateEnvironment ( environ );
}
//update a field
void updateField ( string name, string id )
{
//change the customer name to/from Direct Sports in CUSTOMER table
string sqlStatmt
= "UPDATE customer SET cust_name = :x WHERE cust_id = :y";
statmt = connect->createStatement ( sqlStatmt );
try
{
//substitute the customer name and id into the SQL statement
statmt->setString ( 1, name );
statmt->setString ( 2, id );
statmt->executeUpdate ();
cout << "Update succeeded\n" << endl;
}
cat.
Complete the C++ program and implement the routines that are not .docx
The document describes a C++ program that implements a binary tree data structure with various node-related methods like insertion, searching, and traversal. It includes class definitions for the tree nodes (TreeStruct), the overall tree (Tree), and auxiliary stack and queue classes. Many methods are only declared, leaving their implementation incomplete. The main() function tests the various methods by building a sample tree and printing outputs.
Similar to I just need code for processQueue function using iterators from the .pdf (20)
prog-03.pdfCSci 430 Programming Project #3Deadlock De.docx
prog-03.pdfCSci 430 Programming Project #3Deadlock De.docx
Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx
Complete the C++ program and implement the routines that are n.docx
PostgreSQL Portland Performance Practice Project - Database Test 2 Howto
PostgreSQL Portland Performance Practice Project - Database Test 2 Howto
Codepot - Pig i Hive: szybkie wprowadzenie / Pig and Hive crash course
Codepot - Pig i Hive: szybkie wprowadzenie / Pig and Hive crash course
Need help implementing the skeleton code below, I have provided the .pdf
Need help implementing the skeleton code below, I have provided the .pdf
Part APurposeThis laboratory provides some experience work.docx
Part APurposeThis laboratory provides some experience work.docx
Complete the C++ program and implement the routines that are not .docx
Complete the C++ program and implement the routines that are not .docx
More from allurafashions98
Current Attempt in Progress. At December 31, 2024, Culiumber Imports .pdf
Current Attempt in Progress. At December 31, 2024, Culiumber Imports reported this
information on its balince sheet. During 2025, the compary had the following transactions related
to recelvables.
Prepare the journal ertries to record eachof these five transactions. Assume that no cash
disoounts were taken ca the collections. of accounts receivabie. (Omit cost of goods sold entries.)
(List oll debit entries before credit entries, Credit account tieles are dutomaticaliy indented when
amount is entered. Do not indent manually . If no entry is required, seiect "No Entry. for the
occount tities and enter 0 for the amounts.)
Question 2 of 4 Acopurts Receivible 4. 5. 17000 (To reinstate account previously written off)
\begin{tabular}{l} Cash \\ Accounts Receivatile \\ \hline \end{tabular} (To rocord collection of
accounts recelvable) efextbook and Media List of Accounts Attemptsi unlimited
Enter the January 1, 2025, balances in Accounts Recelvable and Alowance for Doubtful
Accounts, post the entries to the twe? accounts and determine the balances. (Aost entries in the
order of journal entries presented in the previous port.)
List of Accounts Attempts: inlimited (c) The parts of this question must be completed in order.
This part will be available when you complete the part above..
Current Attempt in Progress Waterway Company uses a periodic inventor.pdf
Current Attempt in Progress Waterway Company uses a periodic inventory system. Details for
the inventory account for the month of January, 2020 are as follows: An end of the month
(1/31/20) inventory showed that 110 units were on hand. If the company uses LIFO, what is the
value of the ending inventory? $652$572$550$616.
Current Attempt in Progress The comparative balance.pdf
Current Attempt in Progress The comparative balance sheet of Delta Company appears below:
Using horizontal analysis, show the percentage change for each balance sheet item using 2020 as
a base year. (If percentage
The parts of this question must be completed in order. This part will be available when you
complete the part above..
Current Attempt in Progress Novaks Market recorded the following eve.pdf
Current Attempt in Progress Novak's Market recorded the following events involving a recent
purchase of inventory: Received goods for $112000, terms 2/11,n/30. Returned $2200 of the
shipment for credit. Paid $400 freight on the shipment. Paid the invoice within the discount
period. As a result of these events, the company's inventory increased by $110200. increased by
$107604. increased by $108004. increased by $107996..
Current Attempt in Progress Ivanhoe Corporation reported the followin.pdf
Current Attempt in Progress Ivanhoe Corporation reported the following information (in
thousands) at December 31,2021 :
Additional information: 1. The company purchased long-term investments during the year; none
were sold. 2. The company purchased equipment during the year and sold some equipment that
cost $150 and had a carrying amount of $55 for a gain of $30. Prepare the investing activities
section of Ivanhoe's statement of cash flows for the year, (Show amounts that decrease cash flow
with either a-sign eg, 15,000 or in parenthesis es. (15,000))
IVANHOE CORPORATION Statement of Cash Flows (Partial) (\$ in thousands) Investing
activities $
eTextbook and Media.
Define a class called Disk with two member variables, an int called.pdf
Define a class called Disk with two member variables, an int called width, and a float called
height. Add a constructor that takes two parameters (each of which will be used to set initial
values for the member variables, so set their types accordingly), which uses the values provided
to set the member variables values. Then include a function called display() that has no
parameters and no return,.
Define to be the median of the Exponential () distribution. That is,.pdf
The median of the exponential distribution with rate parameter λ is defined as the value such that the probability of the random variable being less than or equal to that value is 0.5. The formula to calculate the median m in terms of λ for an exponential distribution is m = ln(2)/λ.
Dedewine the bridthenes tar this test Choose the conist answet below .pdf
Dedewine the bridthenes tar this test Choose the conist answet below 4. H,D012 A. Hy: p=0,2
Hh p 0.12 HA p:012 C. H0p=e is D. 4%,=612HAD<015H4p>012 E tho.0.15 1. tho eots in
p=0.15 14 an. 00015 (1) (ires minger io anchis reanded of las decme places as feeded) P saidin
(The wh pheger or decime iovided ss touse aicina jiaces as neoded)
H2<2.12H(-p=0.131rs2015 b. H0;=0.12 E. Ho =0.15 11 in p=0.15.
Davenport Incorporated has two divisions, Howard and Jones. The f.pdf
Davenport Incorporated has two divisions, Howard and Jones. The income statement showed Howard division had a $70,875 profit while Jones division had an $81,000 loss. If the Jones division was dropped, Davenport would have a $70,875 profit for the month.
Data tableRequirements 1. Prepare the income statement for the mon.pdf
Data table
Requirements 1. Prepare the income statement for the month ended July 31,2024. 2. Prepare the
statement of retained earnings for the month ended July 31 , 2024. The beginning balance of
retained earnings was $0. 3. Prepare the balance sheet as of July 31,2024. 4. Calculate the debt
ratio as of July 31,2024..
Current Attempt in Progress Items from Oriole Companys budget for Ma.pdf
Current Attempt in Progress Items from Oriole Company's budget for March, in which 1500
units were produced and sold, appear below: At 1600 units, how much are budgeted variable
manufacturing costs? $24000$46293$21281$19219 eTextbook and Media.
Data tableAfter researching the competitors of EJH Enterprises, yo.pdf
Data table
After researching the competitors of EJH Enterprises, you determine that most comparable firms
have the following valuation ratios EJH Enterprises has EPS of $1,90, EBITDA of $295 million,
$27 million in cash, $42 million in debt, and 105 million shares outstanding. What range of
prices is consistent with both sets of multiples? The range of prices will be: Lowest price within
both ranges, the PIE and EVIEBITDA ranges, is $ (Round to two decimal places.) Highest price
within both ranges, the PIE and the EVIEBITDA ranges, is \$ (Round to two decimal places).
Current Attempt in Progress If a qualitative variable has c categ.pdf
Current Attempt in Progress If a qualitative variable has " c " categories, how many dummy
variables must be created and used in the regression analysis? c1 c 4+cc+1c2.
Data tableData tableThe figures to the right show the BOMs for .pdf
Data table
Data table
The figures to the right show the BOMs for two products, A and B. Table 1 shows the MPS
quantity start date for each one. Table 2 contains data from inventory records for items C,D, and
E. There are no safety stock requirements for any of the items. Determine the material
requirements plan for items C. D, and E for the next 8 weeks. Click the icon to view Table 1.
Click the icon to view Table 2 ..
Data table Requirements 1. Compute the product cost per meal produced.pdf
The document outlines requirements for analyzing costing methods for a food production company. It asks to:
1) Calculate product costs per meal for January and February under absorption and variable costing.
2) Prepare income statements for January and February using absorption and variable costing.
3) Determine if operating income is higher under absorption or variable costing for each month and explain differences.
Darla, Ellen, and Frank have capital balances of $30,000,$40,000 and .pdf
Darla, Ellen, and Frank have capital balances of $30,000,$40,000 and $50,000 respectively
when Ellen personally agrees to buy Daria's share of the partnership. Ellen pays Darla $35,000.
Once the transaction has been recorded, total net assets are $85,000$115,000$90,000$120,000.
Daniel, age 38 , is single and has the following income and exnencac .pdf
Daniel, age 38 , is single and has the following income and exnencac in on?.
a. Classify the following exnenese AGI", or "Not deductible". 7 Gross income: AGI: $ b. Should
Daniel itemize his deductions from AGI or take the standard deduction? Because Daniel's total
itemized deductions (after any limitations) are $ he would benefit from.
Danny Anderson admired his wifes success at selling scarves at local.pdf
Danny Anderson admired his wife's success at selling scarves at local crafts shows, so he The
twig stands are mare populas, so Danny sels tour twig stands for evory one oak decided to make
two types of plant stands to sell at the shows. Danny makes twig stabds out of stand. Kabe
charges her husband \$300 to share her booth at the craft shows \&after all. downed wood from
his backyard and the yaeds of his neighbors, so his variable cost is she has paid the entrance
fees). How many of each plant stand does Darmy need to seil minimal (wood screws, glue, and
so forth) Howover, Danny has to purchase wood to make his to beeakeven? Wil this aflect tie
number of scarves Katie needs to sel to breakevec? ook plant stands. His unit prices and costs are
as follows: Explan (Click the icon to verw the data.) Data table Determine how mamy of each
plant stand Danny ne a per une. First idantify the formula labes, then cemplete the calculations
step by step. Lebs: Weinhted average contribution margin per unit 1+4. 1 * = Breakeven sales in
units Deiemine how many of each plant stands Danny needs to seli to breakeven.
the calculations sesp by stop Areakever sies in unte Determine how many of eoch plant atands
Damy need to sel to breaknven Breakeren cales of twig stands ia Breakeven aaris of oak tiande is
Wia this afect the nurber of scaves riote needt to sell to breakrven' Explain. Or chariging her
hasband part of the cont fair entance fees, her fuod costs will cecised to share her orat hooths..
CX Enterprises has the following expected dividends $1.05 in one yea.pdf
CX Enterprises has the following expected dividends: $1.05 in one year, $1.15 in two years, and
$1.25 in three years. After that, its dividends are expected to grow at 4% per year forever (so that
year 4 's dividend will be 4% more than $1.25 and so on). If CX's equity cost of capital is 11.7%,
what is the current price of its stock? The price of the stock will be $ (Round to the nearest cent.).
Daring the financial crisis an the end of the firs decade of the 2000.pdf
Daring the financial crisis an the end of the firs decade of the 2000 s, Memill Lynch was
acquired by Bank of America for $50 biltion. The reason for the acquisition was that Merrill
Lynch was unsure it could survive the crisis on its own. Bank of America received government
assistance during the financial crisis from (and was thas covered by) TARP (the Troubled Asset
Relief Program). So too then was Merrill Lynch. One initial consequence of TARP coverage was
that some employees, including some high-level, highrevenue generating employecs, began to
leave larger financial institutions like Merrill Lynch/Bank of America to go so-called "boutique"
financial services firms, which had not received TARP money and thus were not covered by
TARP restrictions on compensation. Another initial reaction was an increase in base salary levels
and a decrease in bonns levels, apparently in response to all of the negative publicity boneses had
received and as a way to get around TARP resirictions. One senior executive at the company
roceiving TARP moncy and now paying smaller bosuses and bigger salaries, bowever,
questioned whether TARP-induced greater emphasis on base pay made sense: So, "Yoa're going
to overpay them regularly, instead of just sometimes? However, now that some time has passed,
the eccoomy has recovered (somewhat), and the stock market has botinced back, Merrill Lynch
and other financial services companies are making money again. At Merrill Lynch, there is
always a lot of action and discussion around compensation strategy, Merrill introduced a plan to
expand its number of financial advisors by 8% (about 12,000 people). Where would they come
from? Ohter firms? How would Merrill get them to move? By offering unusually high up-front
signing bonuses and decentralizing authority to make such offers. Traditionally, top berokers
from other firms can receive 1.5 times their pay at the firm they are leaving. Merrill was not the
only firm looking to add top brokers. Indeed, what was described as a "bidding war" broke out,
and signing boeuses were reported to have gone as high as three to four times previous pay in
some cases. Why the bidding war? "Wealth management firms make the bulk of their profits on
the top 10 percent of their producers" - acconding to compensation attorney Ketten Muchin.
And, very wealthy clients tend to be more loyal to their advisors than to the advisors" fims. At
Merrill, there are some concerns among financial advisors. First, in the noe-Merrill part of the
Bank of America, brokers are under a discretionary bonus system rahher than (objective)
incentive syster where pay is based on a formula. Merrill financial advisors fear the Bank of
America wants 3 I P a d e to extend that system to cover them. Second, and likely related, non-
Merrill brokers at Bank of America are expected to cross-sell - in other words, to push prodacts
sold by other parts of the bank. The opportunities for such synergies are typically seen as source
of c.
More from allurafashions98 (20)
Current Attempt in Progress. At December 31, 2024, Culiumber Imports .pdf
Current Attempt in Progress. At December 31, 2024, Culiumber Imports .pdf
Current Attempt in Progress Waterway Company uses a periodic inventor.pdf
Current Attempt in Progress Waterway Company uses a periodic inventor.pdf
Current Attempt in Progress The comparative balance.pdf
Current Attempt in Progress The comparative balance.pdf
Current Attempt in Progress Novaks Market recorded the following eve.pdf
Current Attempt in Progress Novaks Market recorded the following eve.pdf
Current Attempt in Progress Ivanhoe Corporation reported the followin.pdf
Current Attempt in Progress Ivanhoe Corporation reported the followin.pdf
Define a class called Disk with two member variables, an int called.pdf
Define a class called Disk with two member variables, an int called.pdf
Define to be the median of the Exponential () distribution. That is,.pdf
Define to be the median of the Exponential () distribution. That is,.pdf
Dedewine the bridthenes tar this test Choose the conist answet below .pdf
Dedewine the bridthenes tar this test Choose the conist answet below .pdf
Davenport Incorporated has two divisions, Howard and Jones. The f.pdf
Davenport Incorporated has two divisions, Howard and Jones. The f.pdf
Data tableRequirements 1. Prepare the income statement for the mon.pdf
Data tableRequirements 1. Prepare the income statement for the mon.pdf
Current Attempt in Progress Items from Oriole Companys budget for Ma.pdf
Current Attempt in Progress Items from Oriole Companys budget for Ma.pdf
Data tableAfter researching the competitors of EJH Enterprises, yo.pdf
Data tableAfter researching the competitors of EJH Enterprises, yo.pdf
Current Attempt in Progress If a qualitative variable has c categ.pdf
Current Attempt in Progress If a qualitative variable has c categ.pdf
Data tableData tableThe figures to the right show the BOMs for .pdf
Data tableData tableThe figures to the right show the BOMs for .pdf
Data table Requirements 1. Compute the product cost per meal produced.pdf
Data table Requirements 1. Compute the product cost per meal produced.pdf
Darla, Ellen, and Frank have capital balances of $30,000,$40,000 and .pdf
Darla, Ellen, and Frank have capital balances of $30,000,$40,000 and .pdf
Daniel, age 38 , is single and has the following income and exnencac .pdf
Daniel, age 38 , is single and has the following income and exnencac .pdf
Danny Anderson admired his wifes success at selling scarves at local.pdf
Danny Anderson admired his wifes success at selling scarves at local.pdf
CX Enterprises has the following expected dividends $1.05 in one yea.pdf
CX Enterprises has the following expected dividends $1.05 in one yea.pdf
Daring the financial crisis an the end of the firs decade of the 2000.pdf
Daring the financial crisis an the end of the firs decade of the 2000.pdf
Recently uploaded
Main Java[All of the Base Concepts}.docx
This is part 1 of my Java Learning Journey. This Contains Custom methods, classes, constructors, packages, multithreading , try- catch block, finally block and more.
বাংলাদেশ অর্থনৈতিক সমীক্ষা (Economic Review) ২০২৪ UJS App.pdf
বাংলাদেশের অর্থনৈতিক সমীক্ষা ২০২৪ [Bangladesh Economic Review 2024 Bangla.pdf] কম্পিউটার , ট্যাব ও স্মার্ট ফোন ভার্সন সহ সম্পূর্ণ বাংলা ই-বুক বা pdf বই " সুচিপত্র ...বুকমার্ক মেনু 🔖 ও হাইপার লিংক মেনু 📝👆 যুক্ত ..
আমাদের সবার জন্য খুব খুব গুরুত্বপূর্ণ একটি বই ..বিসিএস, ব্যাংক, ইউনিভার্সিটি ভর্তি ও যে কোন প্রতিযোগিতা মূলক পরীক্ষার জন্য এর খুব ইম্পরট্যান্ট একটি বিষয় ...তাছাড়া বাংলাদেশের সাম্প্রতিক যে কোন ডাটা বা তথ্য এই বইতে পাবেন ...
তাই একজন নাগরিক হিসাবে এই তথ্য গুলো আপনার জানা প্রয়োজন ...।
বিসিএস ও ব্যাংক এর লিখিত পরীক্ষা ...+এছাড়া মাধ্যমিক ও উচ্চমাধ্যমিকের স্টুডেন্টদের জন্য অনেক কাজে আসবে ...
The History of Stoke Newington Street Names
Presented at the Stoke Newington Literary Festival on 9th June 2024
www.StokeNewingtonHistory.com
How to Fix the Import Error in the Odoo 17
An import error occurs when a program fails to import a module or library, disrupting its execution. In languages like Python, this issue arises when the specified module cannot be found or accessed, hindering the program's functionality. Resolving import errors is crucial for maintaining smooth software operation and uninterrupted development processes.
How to Make a Field Mandatory in Odoo 17
In Odoo, making a field required can be done through both Python code and XML views. When you set the required attribute to True in Python code, it makes the field required across all views where it's used. Conversely, when you set the required attribute in XML views, it makes the field required only in the context of that particular view.
South African Journal of Science: Writing with integrity workshop (2024)
South African Journal of Science: Writing with integrity workshop (2024)Academy of Science of South Africa
A workshop hosted by the South African Journal of Science aimed at postgraduate students and early career researchers with little or no experience in writing and publishing journal articles.BBR 2024 Summer Sessions Interview Training
Qualitative research interview training by Professor Katrina Pritchard and Dr Helen Williams
Executive Directors Chat Leveraging AI for Diversity, Equity, and Inclusion
Let’s explore the intersection of technology and equity in the final session of our DEI series. Discover how AI tools, like ChatGPT, can be used to support and enhance your nonprofit's DEI initiatives. Participants will gain insights into practical AI applications and get tips for leveraging technology to advance their DEI goals.
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...National Information Standards Organization (NISO)
This presentation was provided by Steph Pollock of The American Psychological Association’s Journals Program, and Damita Snow, of The American Society of Civil Engineers (ASCE), for the initial session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session One: 'Setting Expectations: a DEIA Primer,' was held June 6, 2024.Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
How to Build a Module in Odoo 17 Using the Scaffold Method
Odoo provides an option for creating a module by using a single line command. By using this command the user can make a whole structure of a module. It is very easy for a beginner to make a module. There is no need to make each file manually. This slide will show how to create a module using the scaffold method.
How to Manage Your Lost Opportunities in Odoo 17 CRM
Odoo 17 CRM allows us to track why we lose sales opportunities with "Lost Reasons." This helps analyze our sales process and identify areas for improvement. Here's how to configure lost reasons in Odoo 17 CRM
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Your Skill Boost Masterclass: Strategies for Effective UpskillingExcellence Foundation for South Sudan
Strategies for Effective Upskilling is a presentation by Chinwendu Peace in a Your Skill Boost Masterclass organisation by the Excellence Foundation for South Sudan on 08th and 09th June 2024 from 1 PM to 3 PM on each day.Walmart Business+ and Spark Good for Nonprofits.pdf
"Learn about all the ways Walmart supports nonprofit organizations.
You will hear from Liz Willett, the Head of Nonprofits, and hear about what Walmart is doing to help nonprofits, including Walmart Business and Spark Good. Walmart Business+ is a new offer for nonprofits that offers discounts and also streamlines nonprofits order and expense tracking, saving time and money.
The webinar may also give some examples on how nonprofits can best leverage Walmart Business+.
The event will cover the following::
Walmart Business + (https://business.walmart.com/plus) is a new shopping experience for nonprofits, schools, and local business customers that connects an exclusive online shopping experience to stores. Benefits include free delivery and shipping, a 'Spend Analytics” feature, special discounts, deals and tax-exempt shopping.
Special TechSoup offer for a free 180 days membership, and up to $150 in discounts on eligible orders.
Spark Good (walmart.com/sparkgood) is a charitable platform that enables nonprofits to receive donations directly from customers and associates.
Answers about how you can do more with Walmart!"
Recently uploaded (20)
বাংলাদেশ অর্থনৈতিক সমীক্ষা (Economic Review) ২০২৪ UJS App.pdf
বাংলাদেশ অর্থনৈতিক সমীক্ষা (Economic Review) ২০২৪ UJS App.pdf
Liberal Approach to the Study of Indian Politics.pdf
Liberal Approach to the Study of Indian Politics.pdf
Digital Artefact 1 - Tiny Home Environmental Design
Digital Artefact 1 - Tiny Home Environmental Design
South African Journal of Science: Writing with integrity workshop (2024)
South African Journal of Science: Writing with integrity workshop (2024)
Executive Directors Chat Leveraging AI for Diversity, Equity, and Inclusion
Executive Directors Chat Leveraging AI for Diversity, Equity, and Inclusion
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
How to Build a Module in Odoo 17 Using the Scaffold Method
How to Build a Module in Odoo 17 Using the Scaffold Method
How to Manage Your Lost Opportunities in Odoo 17 CRM
How to Manage Your Lost Opportunities in Odoo 17 CRM
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Walmart Business+ and Spark Good for Nonprofits.pdf
Walmart Business+ and Spark Good for Nonprofits.pdf
I just need code for processQueue function using iterators from the .pdf
- 1. I just need code for processQueue function using iterators from the linkedList class. #include #include #include #include #include "Queuecpp.h" #include "Songcpp.h" #include "RequestCpp.h" void populateRequests(Queue& q); void populateSongDataBase(LinkedList &list); void processQueue(LinkedList &list,Queue& q); void processRequest(std::string action, std::string title,std::string singer,int chartPos); //GIVEN int main() { LinkedList list; Queue q; populateSongDataBase(list); // fill the Songs Data Base into Linked List std::cout<<"*************************************n"; list.printList(); // std::cout<<"*************************************n"; populateRequests(q); // fill the request q std::cout<<"n"; std::cout<<"---------------PRINTING QUEUE-------------------n"; q.printList(); std::cout<<"------------------------------------n"; processQueue(list,q); // process the requests std::cout<<"*************************************n"; list.printList(); std::cout<<"*************************************n"; }
- 2. //GIVEN //Requires an empty linked list //Effects fills the list with request by reading from the RequestData.txt //Modifies the queue by filling it void populateRequests(Queue &q){ } //GIVEN //Requires Filled data base , song to play //Effects Finds song using get, if found plays it //Modifies nothing std::string playSong(LinkedList&list, Song s){ if (list.get(s)>=0){ return "PLAYING :"+ s.toString()+"n"; } else{ return "SONG NOT FOUNDn"; } } //GIVEN //Requires filled database //Effects calls print methood to print top ten songs //Modifies nothing void printTopTenSongs(LinkedList& list){ std::cout<<"PLAYING TOP TEN SONG __________n"; list.print(10); ; } //Requires filled Song Database, a Song to add. The chart position given in the song is where it will get added. Note this is a Song that is not supposed to exist in database. //Effects adds the song from its original chart position
- 3. //Modifies the Song database. Adjust chart position of all Songs affected by this addition- this adjustment is done in insert method using adjustPosition method. If the Process Queue adds a Song that already is in the database, then a duplicate entry can occur. //TODO void addThisSong(LinkedList &list, Song s){ //TODO /* Use this code if (found>=0) {std::cout<<"ADDED THIS SONG "< &list, Song s){ /* Use this code if (found>=0) {std::cout<<"SORRY CANNOT REMOVE THIS SONG - STILL FOUND AT "< &list, Song s, int pos){ int chartPos=list.get(s); std::cout<<"MOVING SONG "< &list,std::string action, std::string title,std::string singer,int chartPos){ Song s(title,singer,chartPos); char ch =action[0]; switch(ch){ case 'P' : std::cout< &list ,Queue& q){ int requestNumber=1; //Create an iterator for the Queue to iteratate through requests std::cout<<"-------------------------------------------------------------------------n"; // call processRequest std::cout<<"-------------------------------------------------------------------------n" std::cout<<"-------------------------------------------------------------------------n"; } //GIVEN //Requires the empty linked list database //Effects if the file exists and accessible, reads from file and inserts songs // IN SORTED ORDER ACCORDING TO CHART POSITION// Big O(N^2) ---> Why?
- 4. //Modifies list - fills it with songs, returns sorted linked list void populateSongDataBase(LinkedList &list){ std::string line=""; std::string token=""; std::string title=""; std::string singer=""; int chartPos=-1; try { std::ifstream input("SongsData.txt"); if (input.fail()) throw new std::string("FILE OPEN ERROR EXCEPTION n"); else{ while (getline(input,line)){ std::istringstream instream(line); getline(instream,title,','); getline(instream,singer,','); instream>>chartPos; Song s(title,singer,chartPos); list.insert(s); } } } catch(std::string message){ std::cout< #include #include #include #include "Queuecpp.h" #include "Songcpp.h" #include "RequestCpp.h" void populateRequests(Queue& q); void populateSongDataBase(LinkedList &list); void processQueue(LinkedList &list,Queue& q); void processRequest(std::string action, std::string title,std::string singer,int chartPos); //GIVEN
- 5. int main() { LinkedList list; Queue q; populateSongDataBase(list); // fill the Songs Data Base into Linked List std::cout<<"*************************************n"; list.printList(); // std::cout<<"*************************************n"; populateRequests(q); // fill the request q std::cout<<"n"; std::cout<<"---------------PRINTING QUEUE-------------------n"; q.printList(); std::cout<<"------------------------------------n"; processQueue(list,q); // process the requests std::cout<<"*************************************n"; list.printList(); std::cout<<"*************************************n"; } //GIVEN //Requires an empty linked list //Effects fills the list with request by reading from the RequestData.txt //Modifies the queue by filling it void populateRequests(Queue &q){ } //GIVEN //Requires Filled data base , song to play //Effects Finds song using get, if found plays it //Modifies nothing std::string playSong(LinkedList&list, Song s){ if (list.get(s)>=0){
- 6. return "PLAYING :"+ s.toString()+"n"; } else{ return "SONG NOT FOUNDn"; } } //GIVEN //Requires filled database //Effects calls print methood to print top ten songs //Modifies nothing void printTopTenSongs(LinkedList& list){ std::cout<<"PLAYING TOP TEN SONG __________n"; list.print(10); ; } //TODO void addThisSong(LinkedList &list, Song s){ //TODO /* Use this code if (found>=0) {std::cout<<"ADDED THIS SONG "< &list, Song s){ /* Use this code if (found>=0) {std::cout<<"SORRY CANNOT REMOVE THIS SONG - STILL FOUND AT "< &list, Song s, int pos){ int chartPos=list.get(s); std::cout<<"MOVING SONG "< &list,std::string action, std::string title,std::string singer,int chartPos){ Song s(title,singer,chartPos); char ch =action[0]; switch(ch){
- 7. case 'P' : std::cout< &list ,Queue& q){ int requestNumber=1; //Create an iterator for the Queue to iteratate through requests std::cout<<"-------------------------------------------------------------------------n"; // call processRequest std::cout<<"-------------------------------------------------------------------------n" std::cout<<"-------------------------------------------------------------------------n"; } //GIVEN void populateSongDataBase(LinkedList &list){ }