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

[+_ M@L!K_MIT Completed]

G this is Right

[bushra]

q1 me just table bany ga any one tell me

[black]

what about q2... share it tooo

[+_ M@L!K_MIT Completed]

For the array drawn below, fill the boxes........ This is requirement

[Sheraz Akram]

just table is banana hai jee..

[Hadi]

is it correct? if yes please share any source which elaborate the concept

[black]

i think 1000000000000logn*n! will come first.. What do u think?

[Sana G]

Most to least arrangements mean greater to less?

[Beenish Asharaf]

then whah is second q ans?

[shahid]

[Sheraz Akram]

no need for heap tree in assignment solution... just need to fill the given empty boxes..

[Muhammad Zia ur Rahman]

15

20

8

56

2

38

36

26

28

7

 

15

20

8

56

7

38

36

26

28

2

 

15

20

38

56

7

8

36

26

28

2

 

15

56

38

28

7

8

36

26

20

2

 

56

28

38

26

7

8

36

15

20

2

Here is Complete Solution best of luck....