Friday, January 20, 2012

[ vuZs.net ] cs301 GDB solution on extended day

Dear

Plase make changes due to submit your GDB on Lms

Best Regards,

Classic example of such an implicit data structure is the heap. A heap, containing N elements form some totally ordered set, is stored as a one dimensional array and certain implicit data structures for priority queues are implemented and compared with a simple linked structure. Timing experiments show that implicit structures are rather slow.

 

Implicit Data structure for priority Queue have following constrains are:

 

  • Keep track of used trees with auxiliary array
  • Store heap structure implicitly in array
  • Extra storage necessary for size list: 0(log n)

 

A heap is a form of efficient self sorting tree. In particular, the root node is guaranteed to be the highest ranked entry in the tree. The comparison function used for ranking the data can, of course, be freely defined. Therefore repeatedly removing the root node will return the data in order of increasing rank. They are often used as priority queues and for scheduling tasks in order of importance.



--
--
Please visit www.vuzs.net For Current & Old Papers, Quizzes, Assignments and study material.
 
To post a new message on this group, send email to vuZs@googlegroups.com
 
Message Posting Rules: http://vuzs.net/faq/4795-vuzs-google-groups-basic-rules-for-posting-messages.html
--
To unsubscribe from this group, send email to vuZs+unsubscribe@googlegroups.com
--
To join this group Send blank email to vuZs+subscribe@googlegroups.com
or visit
http://groups.google.com/group/vuZs/subscribe

No comments:

Post a Comment