Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Which among the following is/are most appropriate for introducing the topic "comparison of size of different objects" in class I : a: Observe different objects and compare. b: Measure using non-standard units and compare. c: Measure using standard units and compare. d: Superimpose the objects and compare.
Consider the following statements: I. The smallest element in a max-heap is always at a leaf node II. The second largest element in a max-heap is always a child of the root node III. A max-heap can be constructed from a binary search tree in Θ(n) time IV. A binary search tree can be constructed from a max-heap in Θ(n) time Which of the above statements are TRUE?
An operator delete(i) for a binary heap data structure is to be designed to delete the item in the i-th node. Assume that the heap is implemented in an array and i refers to the i-th index of the array. If the heap tree has depth d (number of edges on the path from the root to the farthest leaf), then what is the time complexity to re-fix the heap efficiently after the removal of the element? 
In the question three statements are given, followed by three conclusions, I, II and III. You have to consider the statements to be true even if it seems to be at variance from commonly known facts. You have to decide which of the given conclusions, if any, follows from the given statements. Statement I: All race is running. Statement II: Some running is sports. Statement III: Some race is athletics. Conclusion I: Some running are athletics. Conclusion II: All athletics are sports. Conclusion III: Some running are race.
The following sequence is a fibonacci sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21,….. Which technique can be used to get the nth fibonacci term?
A, B, C, E, F and G are six dancers. B cannot dance better than A. A is a better dancer than G. E is a better dancer than C. E cannot dance better than B or G. F is a better dancer than A. Who among these six is the best dancer?
What is the amortized cost per operation of a skew heap?
The main distinguishable characterstic of a binomial heap from a binary heap is that
In a circular running track of diameter 126 m, Rahul start running on running track with speed 8 km/hour. What time he will take to complete one round of running track?
A max-heap is a heap where the value of each parent is greater than or equal to the value of its children. Which of the following is a max-heap?