Write a C++ program that:

  • defines a priorityQ type that is just like a regular Q but Enqueues items by value Defines and implements an aging mechanism to avert starvation.
  • DOES NOT use the heap data structure (to be covered later). Use a dynamic array as the underlying data structure. Implement standard Q functionality, modified by one of the following:
    • A modified dequeue that scans entire Q iot extract highest priority item
    • A modified enqueue that inserts in order (using a parallel index array)
  • tests this priorityQ type on integer data
    • Reads in integer data from P2Input1.txt file
    • Stores all integers in a priorityQ object
    • Extracts 25 integers from the priorityQ object Stores extracted integers (in order extracted) to P2Output.txt
    • Reads in integer data from P2Input2.txt file
    • Stores all integers in a priorityQ object
    • Extracts 25 integers from the priorityQ object Stores extracted integers (in order extracted) to P2Output.txt
Academic Honesty!
It is not our intention to break the school's academic policy. Projects posted are only used as a reference and should not be submitted as is. We are not held liable for any misuse of the solutions. Please see the frequently asked questions page for further questions and inquiries.
Kindly fill out the form. Please provide a valid email address and we'll get back to you in less than 24 hours. We will be sending an invoice through PayPal upon confirmation. We are a non profit organization however we need an amount to keep this organization running, and to be able to complete our research and development.