Answered: This is the souce code for Queues, but…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

This is the souce code for Queues, but it has so many errors. Please update this without errors and warnings.

template<class T>
int queue <T>::isDecreasing() const
{
if (size() < 2) return true;
cout << "test" << endl;

   for (size_t i = 0; i < size() - 1; i++)
   {
       cout << (i + 1 + _front) % _capacity << " : " << elements[(i + 1 + _front) % _capacity] << " vvvvv "
           << (i + _front) % _capacity << " : " << elements[(i + _front) % _capacity] << endl;

       if (elements[(i + 1 + _front) % _capacity] > elements[(i + _front) % _capacity])
           return false;
   }
   return true;
}

template<class T>
size_t queue<T>::count(const T& data) const;
{
   size_t counter = 0;
   for (size_t i = 0; i < size(); i++)
   {
       cout << i << ":" << elements[(_front + i) % _capacity] << endl;
       if (elements[(_front + i) % _capacity] == data) counter++;

}
return counter;
}

Expert Solution

Code of Program

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

   public:
    int isDecreasing() const;
    size_t count(const T&) const;
    int size();
};

template <class T>
int queue<T>::isDecreasing() const {
    if (size() < 2) return true;
    cout << "test" << endl;

    for (size_t i = 0; i < size() - 1; i++) {
        cout << (i + 1 + _front) % _capacity << " : " << elements[(i + 1 + _front) % _capacity] << " vvvvv "
             << (i + _front) % _capacity << " : " << elements[(i + _front) % _capacity] << endl;

        if (elements[(i + 1 + _front) % _capacity] > elements[(i + _front) % _capacity])
            return false;
    }
    return true;
}

template <class T>
size_t queue<T>::count(const T& data) const {
    size_t counter = 0;
    for (size_t i = 0; i < size(); i++) {
        cout << i << ":" << elements[(_front + i) % _capacity] << endl;
        if (elements[(_front + i) % _capacity] == data) counter++;
    }
    return counter;
}

int main() {
}