Saved Bookmarks
| 1. |
Define A Priority Queue? |
|
Answer» PRIORITY queue is a collection of elements, each containing a key referred as the priority for that element. Elements can be inserted in any order (i.e., of alternating priority), but are ARRANGED in order of their priority VALUE in the queue. The elements are deleted from the queue in the order of their priority (i.e., the elements with the HIGHEST priority is deleted first). The elements with the same priority are given EQUAL importance and processed accordingly. Priority queue is a collection of elements, each containing a key referred as the priority for that element. Elements can be inserted in any order (i.e., of alternating priority), but are arranged in order of their priority value in the queue. The elements are deleted from the queue in the order of their priority (i.e., the elements with the highest priority is deleted first). The elements with the same priority are given equal importance and processed accordingly. |
|