Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Problem 4 Relaxed Binomial Heaps 5+5+5 15 marks] Recall that in a binomial heap, binomial trees of different orders appear in a sorted order i.e.,

image text in transcribed

Problem 4 Relaxed Binomial Heaps 5+5+5 15 marks] Recall that in a binomial heap, binomial trees of different orders appear in a sorted order i.e., the root of binomial tree of a given order points to the root of a binomial tree of larger order. Consider a relared binomial heap where binomial heaps can appear in any order. The figure below shows a relaxed binomial heap 70 30 90 30 60 20 10 15 12 17 Relaxed heap Figure 3: A relaxed binomial heap a) Indicate whether time complexity of get-Max operation changes in relaxed binomial heaps compared to regular binomial heaps. If it does, indicate what the time complex- ity of get-Max is. Provide a brief justification of your answer b) Indicate whether time complexity of merge (union) operation changes in relaxed b nomial heaps compared to regular binomial h complexity of merge is. Provide a brief justification of your answer heaps. If it does, indicate what the time c) Indicate whether time complexity of extract-Max) operation changes in relaxed binomial heaps compared to regular binomial heaps. If it does, indicate what the time complexity of extract-Max is. Provide a brief justification of your answer Problem 4 Relaxed Binomial Heaps 5+5+5 15 marks] Recall that in a binomial heap, binomial trees of different orders appear in a sorted order i.e., the root of binomial tree of a given order points to the root of a binomial tree of larger order. Consider a relared binomial heap where binomial heaps can appear in any order. The figure below shows a relaxed binomial heap 70 30 90 30 60 20 10 15 12 17 Relaxed heap Figure 3: A relaxed binomial heap a) Indicate whether time complexity of get-Max operation changes in relaxed binomial heaps compared to regular binomial heaps. If it does, indicate what the time complex- ity of get-Max is. Provide a brief justification of your answer b) Indicate whether time complexity of merge (union) operation changes in relaxed b nomial heaps compared to regular binomial h complexity of merge is. Provide a brief justification of your answer heaps. If it does, indicate what the time c) Indicate whether time complexity of extract-Max) operation changes in relaxed binomial heaps compared to regular binomial heaps. If it does, indicate what the time complexity of extract-Max is. Provide a brief justification of your

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database And Expert Systems Applications 24th International Conference Dexa 2013 Prague Czech Republic August 2013 Proceedings Part 1 Lncs 8055

Authors: Hendrik Decker ,Lenka Lhotska ,Sebastian Link ,Josef Basl ,A Min Tjoa

2013 Edition

3642402844, 978-3642402845

More Books

Students also viewed these Databases questions

Question

Define Decision making

Answered: 1 week ago

Question

What are the major social responsibilities of business managers ?

Answered: 1 week ago

Question

What are the skills of management ?

Answered: 1 week ago