Access to elements that have been inserted into the queue

Assignment Help Data Structure & Algorithms

Reference no: EM132103872

A priority queue is a queue where a numeric priority is associated with each element.

Access to elements that have been inserted into the queue is limited to inspection and removal of the elements with smallest and largest priority only.

A priority queue may have multiple items that are of equal priority.

By "bounded", it is meant that the priority queue has a maximum capacity specified when it is created, and it can never contain more than that number of items. Your specification must specify the following operations:

newPriorityQueue: make a new queue

insert: inserts an element with a certain priority

isEmpty: test if the queue is empty

isFull: test if the queue is full

maxItem: obtain the item in the queue with the highest priority

minItem: obtain the item in the queue with the lowest priority

deleteMax: remove from the queue the item with the highest priority

deleteAllMax: remove from the queue all items that are tied for the highest priority

deleteMin: remove from the queue the item with the lowest priority frequency: obtain the number of times a certain item occurs in the queue (with any priority)

showing it in the form of sets signatures , preconditions and semantics.

Reference no: EM132103872

Questions Cloud

Purchase computers for nick business : Jason, who is very knowledgeable regarding computers, agrees to purchase computers for Nick's business.

What circumstances would cause you to do those things : Why would you worry about doing any privilege escalation or leaving backdoors? What circumstances would cause you to do either of those things?

Compare the execution times of the two versions of program : Write a C program to compute binom(n,m) recursively. The values for n and m should be passed as command-line arguments with appropriate error checking.

What are the characteristics of an ideal memory : What are the characteristics of an ideal memory? Explain the concept of locality of reference both with respect to instructions and data.

Access to elements that have been inserted into the queue : Access to elements that have been inserted into the queue is limited to inspection and removal of the elements with smallest and largest priority only.

Calculate the number of mantissa digits : Using a technique explained in the class, calculate the number of mantissa digits and the unit round-off on the machine that you will use for this course.

What are some examples of marketing activities : What are some examples of "marketing" activities that are associated with the Summer Olympics? How does global marketing

Discuss about privacy preserving data mining methods : "Privacy preserving data mining" is designed to ensure privacy of individuals while performing data mining.

Explain what security vulnerabilities you would look for : Assume you are asked to assess the security of an electronic medical record(EMR) system.

User Account

All Pages