Virtual University of Pakistan Study forum !
Please read the following instructions carefully before solving & submitting assignment:
It should be clear that your assignment will not get any credit (marks) if:
Ø The assignment is submitted after due date.
Ø The submitted assignment file is not in .doc or .docx format.
Ø The submitted assignment file does not open or corrupted.
Ø The assignment is copied (from other student or ditto copy from handouts or internet).
Ø Do not wait for grace day. Grace Day is given only if there is problem with LMS on due date. Submit your solution within due date.
Ø Note that no assignment will be accepted through email if there is any problem in LMS on grace day.
The objective of this assignment is
o To make you familiar with working of heap data structure, techniques to implement and understand working of this data structure.
For any query about the assignment, contact at firstname.lastname@example.org
Question: Marks 20
Data: 4 3 2 8 9 5 11 18 12
a) Consider the data given above and construct max heaping using step by step construction method. After building max heap show only final tree and array status. Marks 5+5
b) Use same data given above and construct max heap after Heapify whole tree at once. Marks 5+5
For any query send email at CS301@vu.edu.pk
check this solution
Checkout Full solution of assignment 02 data structure
kon sa solution thek cute samra
check this correct and full solution
how to draw the diagram
check this link full solution