www.vustudents.ning.com

# ASSIGNMENT 2 CS502 fundamental alogrithm DUE DATE 4 JUNE

ASSIGNMENT 2
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

Views: 19436

Attachments:

### Replies to This Discussion

start discussion

WOW NICE BUT NEED EXPERT

AoA! hun nwy triqa strt hogya... Narrate  ke k dyv....

no need to narrate in this assignment.

aoa build heap m min heap use karna ha ya max heap .guys have u any idea

Max Heap "Assume that the root of the heap holds the maximum element."

Our main purpose here discussion not just Solution
We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions.

this assign cover lecture 9  pag 32 selection problem

but i think this assignment covers lecture no 12 .

koi 2 solution add kro guyx plxxxx!

Thank you very much.

please first part ka bhi koyee solution day dain.

1

2

3