Your assignment must be uploaded/submitted at or before 4th June 2015.
Please view the assignment submission process document provided to you by the Virtual University to upload the assignment. And submit your solution as Microsoft word file.
Rules for Marking
It should be clear that your assignment will not get any credit if:
oThe assignment is submitted after due date.
oThe submitted assignment does not open or run.
oThe assignment is copied
Problem #1: 10 marks
Recall BuildHeap (1,n) that builds a heap of n-elements from an array:
for i = n/2 downto 1 do
For the array drawn below, fill the boxes for each iteration of BuildHeap(1,10).
Assume that the root of the heap holds the maximum element.
Problem #2: 5 marks
Arrange the following in the Most to Least complexity order.
yes i am agree with u dil nawaz..max heap 5 iteration ma ban he nahi sakte complete ya 7 iteration ma bante hai 5 iteration ma jna tak ap na bane vha tak he bante hai
here is the solution guys. main ne sirf 5 iteretion tk kia hai. waisy 7 banti hain complete max heap k liye is combination k sath.
next 3 pic ye hain.
Thts iteration tree right or wrong???
wo kaisey hoga????
kindly build heap bananay ka tareeqa bta dein question me i=n/2 hai aur root of the heap maixmum batya hai aur i=n/2 left node pay lagani hai ya right node pay kis tarah pta chalay ga
Watch this video.
Sheraz bhai ye site blocked hai kesay dekhen ye video plz ap is videio ka over view dy dn plz.
Time is too short
youtube unblocker likh kar yeh link paste kar kay sun lay
time is too short plz help kar do mera table sahi hai