We have been working very hard since 2009 to facilitate in learning Read More. We can't keep up without your support. Donate.

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

Views: 19424

Attachments:

Replies to This Discussion

g lg tu thek rha ha bro kia q.1 ka just table bnana ha ?? means k complete ans bs itna he ho ga ???

complete ans yahi hai

CS501 ki assignment banna li aap ne?

jee submit kar de hai

Please send me on my email address: iamsheraz@gmail.com

I shall be very thankful to you..

me too 

Iteration

15

20

8

56

2

38

36

26

28

7

1

15

20

8

56

2

38

36

26

28

7

2

15

20

8

28

2

38

36

26

56

7

3

15

20

38

28

2

8

36

26

56

7

4

15

28

38

56

2

8

36

26

20

7

5

28

56

38

26

2

8

36

15

20

7

please guide is it correct answer?

kindly upload the solution 

ok thnks bro 

this table is wrong 5 iteration mangi hai agar hum 6 step per jaye tab yah answer ata 5  per nahi rehan yakoob

ans hai 56, 15,38,28,7,8,36,26,20,2 nd its 100% correct ans

RSS

Looking For Something? Search Below

© 2021   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service