adplus-dvertising
frame-decoration

Question

What is the complexity of given function of insertion. 
insert(int n)
 {
  if(buffer_size()< maxi_biffer_size())
  buffer_aar[ind]==n;
  else
  move_to_heap(buffer,buffer+maxi_buffer_size())
 }

a.

O(logn)

b.

amortized O(1)

c.

O(n)

d.

None of the mentioned

Posted under Data Structures and Algorithms

Answer: (b).amortized O(1)

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What is the complexity of given function of insertion.
Add Comment

Similar Questions

Discover Related MCQs

Q. Does there exist a heap with seven distinct elements so that the Inorder traversal gives the element in sorted order.

View solution

Q. The leaf node for a heap of height h will be at which position.

View solution

Q. The main distinguishable characterstic of a binomial heap from a binary heap is that

View solution

Q. The number of trees in a binomial heap with n nodes is

View solution

Q. In a binomial heap the root value is greater than left child and less than right child.

View solution

Q. What is order of resultant heap after merging two tree of order k?

View solution

Q. Time taken in decreasing the node value in a binomial heap is

View solution

Q. Which of these operations have same complexities?

View solution

Q. The Statement “Fibonacci heap has better amortized running time in compare to a binomial heap”.

View solution

Q. Given a heap of n nodes.The maximum number of tree for building the heap is.

View solution

Q. Choose the option with function having same complexity for a fibonacci heap.

View solution

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
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!

Data Structures and Algorithms

Journey through the fundamentals of Data Structures and Algorithms with our extensive...

Discrete Mathematics

Refine your mathematical skills essential for computer science with our Discrete...

JavaScript

Strengthen your web development skills with our JavaScript MCQs. Understand core...

C# programming

Hone your skills in the C# language with our MCQs. Understand data types, operators,...

Computer Graphics

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

Internet of Things (IoT)

Discover how devices communicate with each other in the smart world with our IoT...

Neural Networks

Dive into the world of Artificial Intelligence with our Neural Networks MCQs. Uncover...

MySQL Database

Enhance your knowledge of relational databases with our MySQL MCQs. Understand...

Cloud Computing

Stay on top of the biggest trend in IT with our Cloud Computing MCQs. These questions...