Data Structures and Algorithms-I MCQs

Page No. 19

Choose the correct properties of weak-heap.


aEvery node has value greater than the value of child node


bEvery right child of node has greater value than parent node


cEvery left child of node has greater value than parent node


dEvery left and right child of node has same value as parent node



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


aInsertion, Union


bInsertion, Deletion


cextract_min, insertion


dUnion, delete


View Answer Insertion, Union

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


an


bn-1


cn/2


dlogn


View Answer n

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


aTrue


bFalse


ceither true either false


dNone of the mentioned


View Answer True

Which of these operations have same complexities?


aInsertion, find_min


bFind_min, union


cUnion, Insertion


dDeletion, Find _max


View Answer Union, Insertion

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


aO(n)


bO(1)


cO(logn)


dO(nlogn)


View Answer O(logn)

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


a2*k


bk+1


ck*k


dk+logk


View Answer k+1

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


aTrue


bFalse


ceither true either false


dNone of the mentioned


View Answer False

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


alogn


bn


cnlogn


dn/2


View Answer logn

The main distinguishable characteristic of a binomial heap from a binary heap is that


ait allows union operations very efficiently


bit does not allow union operations that could easily be implemented in binary heap


cthe heap structure is not similar to complete binary tree


dthe location of child node is not fixed i.e child nodes could be at level (h-2) or (h-3), where h is height of heap and h>4



Goto Page No.

Page 19 of 53

Alphabetical MCQs Categories

Here below You find all kind of categories of MCQs in alphabetical order.


"Comprehensive Collection of MCQs: Alphabetically Organized by Subject"

"Discover an extensive collection of multiple-choice questions (MCQs) neatly categorized by subject from A to Z. This resource is designed for anyone eager to explore various topics in a straightforward and organized manner. Whether you're a student preparing for exams, an educator seeking supplementary materials, or simply curious about different subjects, this compilation offers a convenient way to learn and assess your knowledge. With questions arranged alphabetically, navigation is effortless, allowing you to delve into subjects of interest at your own pace. Engage, learn, and expand your understanding with this accessible and comprehensive repository of MCQs!"


BolPakistan

bolpakistan.com.pk includes Job Mcqs and Pak Mcqs is the Top Largest Mcqs Forum in World, in which you can read Mcqs of All Subjects, PPSC test preparation, FPSC, NTS and PPSC PAST PAPERS, PPSC PAST MCQS. A Collection of Repeated MCQs for JOBs seekers.

Copyright © 2024, Designed & Developed by BolPakistan