1. Implement a Stack and Queue class using a vector •Only need to have Push, Pop
ID: 3738834 • Letter: 1
Question
1. Implement a Stack and Queue class using a vector
•Only need to have Push, Pop, and Print
2. Generate two lists containing 100 randomly generated numbers from 1 to 50
•Populate the Stack with one list and the Queue with the other list
3. Sort the numbers from least to greatest by outputting them to .txt file and sorting and saving them using Excel or Google sheets
4. Implement LinearSearch and BinarySearch on the two sorted lists by searching for the number 12
•If 12 is found in either list, print the index at which it occurs in the list
5. Print the Stack and Queue lists from greatest to least
Explanation / Answer
/* Stack class by using vector */
#include<iostream>
#include<vector>
using namespace std;
class Stack
{
vector<int> stackdata;
// int top=-1;
public:
void push(int );
void pop();
void print();
};
void Stack :: push(int x)
{
stackdata.push_back(x);
}
void Stack :: pop()
{
if(stackdata.empty())
cout<<"Undeerflow ";
else
{
stackdata.erase(stackdata.end());
}
}
void Stack :: print()
{
for(int i=0;i<stackdata.size();i++)
cout<<stackdata[i]<<",";
cout<<" ";
}
/*--------------------------------*/
/* Queue class by using vector */
#include<iostream>
#include<vector>
using namespace std;
class Queue
{
vector<int> queuedata;
public:
void enqueue(int); //Push function
void dequeue(); // pop function
void print();
};
void Queue :: enqueue(int x)
{
queuedata.push_back(x);
}
void Queue :: dequeue()
{ if(queuedata.empty())
cout<<"Underflow ";
else
queuedata.erase(queuedata.begin());
}
void Queue :: print()
{
for(int i=0;i<queuedata.size();i++)
cout<<queuedata[i]<<",";
cout<<" ";
}
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.