Question

What will be the order of new heap created after union of heap H1 and H2 when created by the following code.Initially both are of the order n.

FIB_UNION(H1,H2)
 {
  H =MAKE_HEAP()
  min[H]= min[H1]
  concatenate the root list of H2 with the root list of H
  if (min[H1] = NIL) or (min[H2]!= NIL and min[H2] < min[H1])
  then min[H] = min[H2]
  n[H]=  n[H1] + n[H2]
  free the objects H1 and H2
  return H
 }

a.

n+1

b.

n+n/2

c.

nlogn

d.

2*n

Posted under Data Structures and Algorithms

Answer: (a).n+1

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What will be the order of new heap created after union of heap H1 and H2 when created by the following code.Initially both are of the order n.

Add Comment

Similar Questions

Discover Related MCQs

Q. What is a hash table?

View solution

Q. If several elements are competing for the same bucket in the hash table, what is it called?

View solution

Q. What is direct addressing?

View solution

Q. What is the search complexity in direct addressing?

View solution

Q. What is a hash function?

View solution

Q. What can be the techniques to avoid collision?

View solution

Q. What is the load factor?

View solution

Q. What is simple uniform hashing?

View solution

Q. In simple uniform hashing, what is the search complexity?

View solution

Q. In simple chaining, what data structure is appropriate?

View solution

Q. When is it appropriate to use direct addressing?

View solution

Q. What is the time complexity to insert an element into the direct address table?

View solution

Q. What is the advantage of using a dynamic set in direct addressing?

View solution

Q. What is the time complexity to delete an element from the direct address table?

View solution

Q. How is a bit vector better compared to a normal array for implementing the hash table?

View solution

Q. A ________ is a special Tree-based data structure in which the tree is a complete binary tree.

View solution

Q. How many type of heap are there?

View solution

Q. In which heap the root node must be greatest among the keys present at all of its children?

View solution

Q. What is the complexity of adding an element to the heap?

View solution

Q. An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of

View solution

View All MCQs on Data Structures and Algorithms

Suggested Topics

Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

UNIX

Become proficient with the Unix operating system using our UNIX MCQs. Learn about...

MS Office

Master the suite of productivity tools with our MS Office MCQs. From Word and Excel...

Java Spring Framework

Enhance your Java development skills with our Spring Framework MCQs. Learn about...

Computer Graphics

Step into the visual side of computing with our Computer Graphics MCQs. Cover topics...

Systems Analysis and Design Methods

Get familiar with the process of designing and improving business systems with our...

Embedded Systems

Dive into the world of specialized computing systems with our Embedded Systems MCQs....

R Programming

Unleash the power of statistical computing with our R Programming MCQs. Topics cover...

Data Warehousing and OLAP

Strengthen your knowledge of Data Warehousing and OLAP with our specialized MCQs....

Operating System

Dive deep into the core of computers with our Operating System MCQs. Learn about...