# YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

## Skew Heap Multiple choice Questions and Answers (MCQs)

Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

..... is a self-adjusting version of a leftist heap.

Rightist heap | |

Skew heap | |

d-heap | |

Binary heap |

Question 1 Explanation:

A skew heap is a self-adjusting version of a leftist heap and it is simpler to implement.

Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

The worst case running time of all operations in a skew heap is given as?

O(N) | |

O(N log N) | |

O(N ^{2}) | |

O(M log N) |

Question 2 Explanation:

The worst case running time of all operations in a skew heap is mathematically found to be O(N).

Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

What is the amortized cost per operation of a skew heap?

O(N) | |

O(N log N) | |

O(N ^{2}) | |

O(log N) |

Question 3 Explanation:

The amortized cost per operation of a skew heap is O(log N) since the worst case analysis of skew heap is O(N) and splay tree is O(M log N).

Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

The relationship of skew heaps to leftist heaps is analogous to that of?

Splay tree and AVL tree | |

Red black tree and AVL tree | |

Binary tree and Splay tree | |

Binary tree and Red black tree |

Question 4 Explanation:

Splay tree is a self -adjusting version of AVL tree. Similarly, skew heap is a self-adjusting version of leftist heap.

Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

What is the fundamental operation performed in skew heaps?

intersection | |

difference | |

merging | |

sorting |

Question 5 Explanation:

The fundamental operation of skew heaps is merging. Hence, it is similar to that of a leftist heap.

There are 5 questions to complete.