Dated: Jan 16, 12
Graded Discussion Board (GDB) will be launched on 19th January and it will remain open for two days.
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.
Please Discuss here about this GDB.Thanks
SpArKlE fAiRy gud keep it up
yahoo answer se pocha hai na.. bary chalak ho...
Is heap an implicit data structure for Priority queue?
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.
tariq bai font change karny say kia hu ga?
Plz upload other ideas
Tariq bhai kuchh kro yaar ;-)
is ka ans no he mjhe yes lg raha heAheap is a data structure that providis an efficient implimentation of priority queue.
no hai answer.
yar is k ley abstrc
is ka ans yes main ha kyun k heap priority queue main use hota ha
to ap hi correct solution upload kr do please Tariq bhai jld hi solution upload kro................