The topic for GDB is:
“Is heap an implicit data structure for Priority queue? yes or no justify. “
A concise, coherent and to-the-point comment is preferred over lengthy comment having irrelevant details.
Comments posted on regular Lesson's MDB or sent through e-mail will NOT be considered.
Graded Discussion Board (GDB) will be launched on 19th January and it will remain open for two days.
Solution:
No. A priority queue is an abstract data structure, independent of how the data is organized. A priority queue can be implemented as an unordered list, a sorted list, a linked list, etc. Some better than others in their support of the priority queue operations, depending on the characteristics of the data to be managed. A heap happens to be a good data structure for an efficient implementation of a priority queue.
Join Our Groups:
Groups.Google.Com/group/vubest
facebook.com/groups/vubest
If you Like This. Please Like us on facebook
Thumbs Up
Comments
Post a Comment