![]() ![]() Ii) No more than fixed amount of storage is allocated causing overflow. I) Fixed amount of storage remains allocated to the data structure even if it contains less element. What Are The Disadvantages Of Sequential Storage? Ii) Descending priority queue- Here largest item can be removed (insertion is arbitrary). I) Ascending priority queue- Here smallest item can be removed (insertion is arbitrary). The priority queue is a data structure in which the intrinsic ordering of the elements (numeric or alphabetic)ĭetermines the result of its basic operation. It obeys FIFO rule there is no limit to the number of elements a queue contains.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |