Assignment Expected Implement Priority Queue Pq Heap Static Array Size 1000 Manage Line Cl Q37031036

In this assignment, you are expected to implement a priorityqueue (PQ) as a heap in a static array of size 1000 to manage aline of clients in a bank. A record of a client is defined by thefollowing structure: the name of a client, its date of birth, anumeric value indicating the client’s account balance. Olderclients should have higher priority over young ones. The program tobe implemented should then randomly generate 1000 “operations”,where an operation can be a “push” of a client’s record (randomlygenerated) or a “pop” removing the client from the front of thequeue and printing its record in

OR
OR

Leave a Comment

This site uses Akismet to reduce spam. Learn how your comment data is processed.