Answered: This is the source code for Stacks, but…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

This is the source code for Stacks, but it has errors. Please update this without errors and warnings. And please provide the main function.

template<class T>
bool Stack<T>::isConsecutive(const T & data) const
{
size_t p = _top - 2;
cout<<(p+1>0)<<p<<endl;

for (size_t i = _top - 2; i + 1 > 0; i--) {
cout << elements[i]<<" "<<elements[i+1]<<endl;
if (elements[i] == data && elements[i] == elements[i + 1]) return true;
}
return false;
}
template<class T>
void Stack<T>::reverse()
{

T* temp = new T[_capacity];
size_t tail = _top;
for (size_t i = 0; i < tail; ++i) {
cout<<i<<" "<<peek()<<endl;
temp[i] = pop();
cout<<i<<" temp "<<temp[i]<<endl;
}
delete[] elements;
elements = temp;
_top = tail;
cout<<" elements "<<elements[0]<<endl;

}

Expert Solution

Code of Program

#include <iostream>
using namespace std;
template <typename T>
class Stack {
   private:
    int _capacity, _top;
    int elements[];

   public:
    bool isConsecutive(const T&) const;
    void reverse();
    T peek();
    T pop();
};

template <class T>
bool Stack<T>::isConsecutive(const T& data) const {
    size_t p = _top - 2;
    cout << (p + 1 > 0) << p << endl;

    for (size_t i = _top - 2; i + 1 > 0; i--) {
        cout << elements[i] << " " << elements[i + 1] << endl;
        if (elements[i] == data && elements[i] == elements[i + 1]) return true;
    }
    return false;
}

template <class T>
void Stack<T>::reverse() {
    T* temp = new T[_capacity];
    size_t tail = _top;
    for (size_t i = 0; i < tail; ++i) {
        cout << i << " " << peek() << endl;
        temp[i] = pop();
        cout << i << " temp " << temp[i] << endl;
    }
    delete[] elements;
    elements = temp;
    _top = tail;
    cout << " elements " << elements[0] << endl;
}

int main() {
}