LEARN MORE...

Solution3

Content type

User Generated

Subject

Computer Science

Type

Homework

Uploaded By

xbune844

Pages

Showing Page:

1/5

queueADT.h

//*************************************************************

// Author: D.S. Malik

// This class specifies the basic operations on a queue.

//*************************************************************

template <class Type>

class queueADT

{

public:

virtual bool isEmptyQueue() const = 0;

//Function to determine whether the queue is empty.

//Postcondition: Returns true if the queue is empty,

// otherwise returns false.

virtual bool isFullQueue() const = 0;

//Function to determine whether the queue is full.

//Postcondition: Returns true if the queue is full,

// otherwise returns false.

virtual void initializeQueue() = 0;

//Function to initialize the queue to an empty state.

//Postcondition: The queue is empty.

virtual Type front() const = 0;

//Function to return the first element of the queue.

//Precondition: The queue exists and is not empty.

//Postcondition: If the queue is empty, the program

// terminates; otherwise, the first element of the queue

// is returned.#pragma once

virtual Type back() const = 0;

//Function to return the last element of the queue.

//Precondition: The queue exists and is not empty.

//Postcondition: If the queue is empty, the program

// terminates; otherwise, the last element of the queue

// is returned.

virtual void addQueue(const Type& queueElement) = 0;

//Function to add queueElement to the queue.

//Precondition: The queue exists and is not full.

//Postcondition: The queue is changed and queueElement is

// added to the queue.

virtual void deleteQueue() = 0;

//Function to remove the first element of the queue.

//Precondition: The queue exists and is not empty.

//Postcondition: The queue is changed and the first element

// is removed from the queue.

};

#pragma once

linkedQueue.h

//Definition of the node

#include <assert.h>

#include "queueADT.h"

template <class Type>

struct nodeType

{

Type info;

nodeType<Type> *link;

};

template <class Type>

Showing Page:

2/5

class linkedQueueType : public queueADT<Type>

{

public:

const linkedQueueType<Type>& operator=

(const linkedQueueType<Type>&);

//Overload the assignment operator.

bool isEmptyQueue() const;

//Function to determine whether the queue is empty.

//Postcondition: Returns true if the queue is empty,

// otherwise returns false.

bool isFullQueue() const;

//Function to determine whether the queue is full.

//Postcondition: Returns true if the queue is full,

// otherwise returns false.

void initializeQueue();

//Function to initialize the queue to an empty state.

//Postcondition: queueFront = NULL; queueRear = NULL

Type front() const;

//Function to return the first element of the queue.

//Precondition: The queue exists and is not empty.

//Postcondition: If the queue is empty, the program

// terminates; otherwise, the first element of the

// queue is returned.

Type back() const;

//Function to return the last element of the queue.

//Precondition: The queue exists and is not empty.#pragma once

//Postcondition: If the queue is empty, the program

// terminates; otherwise, the last element of the

// queue is returned.

void addQueue(const Type& queueElement);

//Function to add queueElement to the queue.

//Precondition: The queue exists and is not full.

//Postcondition: The queue is changed and queueElement is

// added to the queue.

void deleteQueue();

//Function to remove the first element of the queue.

//Precondition: The queue exists and is not empty.

//Postcondition: The queue is changed and the first element

// is removed from the queue.

linkedQueueType();

//Default constructor

linkedQueueType(const linkedQueueType<Type>& otherQueue);

//Copy constructor

~linkedQueueType();

//Destructor

private:

nodeType<Type> *queueFront; //pointer to the front of the queue

nodeType<Type> *queueRear; //pointer to the rear of the queue

};

template <class Type>

bool linkedQueueType<Type>::isEmptyQueue() const

{

return(queueFront == NULL);

} //end

template <class Type>

bool linkedQueueType<Type>::isFullQueue() const

{

return false;

} //end isFullQueue

Showing Page:

3/5

End of Preview - Want to read all 5 pages?

Access Now

Unformatted Attachment Preview

queueADT.h //************************************************************* // Author: D.S. Malik // // This class specifies the basic operations on a queue. //************************************************************* template class queueADT { public: virtual bool isEmptyQueue() const = 0; //Function to determine whether the queue is empty. //Postcondition: Returns true if the queue is empty, // otherwise returns false. virtual bool isFullQueue() const = 0; //Function to determine whether the queue is full. //Postcondition: Returns true if the queue is full, // otherwise returns false. virtual void initializeQueue() = 0; //Function to initialize the queue to an empty state. //Postcondition: The queue is empty. virtual Type front() const = 0; //Function to return the first element of the queue. //Precondition: The queue exists and is not empty. //Postcondition: If the queue is empty, the program // terminates; otherwise, the first element of the queue // is returned.#pragma once virtual Type back() const = 0; //Function to return the last element of the queue. //Precondition: The queue exists and is not empty. //Postcondition: If the queue is empty, the program // terminates; otherwise, the last element of the queue // is returned. virtual void addQueue(const Type& queueElement) = 0; //Function to add queueElement to the queue. //Precondition: The queue exists and is not full. //Postcondition: The queue is changed and queueElement is // added to the queue. virt ...
Purchase document to see full attachment

Tags: linked list Implement a Queue