Data Structures Program: Working with Queues and Stacks

In this assignment, you will implement various helper methods on queues and stacks to reinforce your understanding of these data structures.  

Please download the starter files for this assignment from the Files tab (Assignment7.zip).  Do not alter the class definition or driver code in any way.  Programs that crash are subject to a 50% penalty.   Please submit the class header files only (Queue.h" and "Stack.h").  PLEASE NOTE: You may not use any Standard Template Library (STL) classes for this assignment; use code provided by the instructor only. 

Working with Queues 

1. Create a method on the Queue class that calculates the number of times a given value occurs in the queue. 

2. Create a method on the Queue class that determines whether the queue is in descending order.

Working with Stacks

1. Create a method on the Stack class that determines whether a given value occurs consecutively in the stack. 

2. Create a method on the Stack class that reverses the values on the stack.

Attachment:- Assignment Files.zip