ASSIGNMENT 2 CS502 fundamental alogrithm DUE DATE 4 JUNE

[papa ki pari (M.I.T) student]

ASSIGNMENT 2
Deadline
Your assignment must be uploaded/submitted at or before 4th June 2015.
Uploading instructions
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
bubble_down(i);
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.
15
20
8
56
2
38
36
26
28
7
Problem #2: 5 marks
Arrange the following in the Most to Least complexity order.
210000023232log1000000000000000100000000000000log*log1000000000000log*!log**1000000000000000

[shahid]

how it possible

[MIT student]

It'll be helpful for understanding and solving 1st Qstn...IN SHAA ALLAH !!

[Muhammad Zia ur Rahman]

Yah this is helpful for heapSort Algorithm but not for BuildHeap...

[+_ M@L!K_MIT Completed]

It tried as per my concepts if any conspiracy kindly reply here.

[azmat~MCS 4]

brother total itration kitni krni hain or 2nd q. ka kuch bata dain kindly