Daily Updates
   HTML
   HTML5
   CSS
   CSS3
   JavaScript
   jQuery
   AngularJS
   Articles
   Blog
logo
Algorithm - Quiz(MCQ)
Algorithms: Consider a B-tree of order 4 and is built from scratch by 10 successive insertions. What would be the maximum number of node splitting operations that take place?
A)
6
B)
4
C)
3
D)
2

Correct Answer : Option (D) :   2

Explanation :

A B-tree of order m contains n records and each contains b records on average then the tree will have about n/b leaves. If we split k nodes along the path from leaves then
k<=1+logm/2 [n/b]
here n=10,b=3,m=4 so
k<=1+log4/2 [n/b]
k<=1+log2 4
k<= 1+2
k<=3

Recently Updated in Algorithm Questions
Q .
External entities in DFD are shown by_________
A)
Circle
B)
Ellipse
C)
Hexagon
D)
Rectangle

Correct Answer : Option (D) :   Rectangle

Q .
Assume that we use Bubble Sort to sort n distinct elements in ascending order. When does the best case of Bubble Sort occur?
A)
When elements are sorted in ascending order
B)
When elements are not sorted by any order
C)
When elements are sorted in descending order
D)
There is no best case for Bubble Sort. It always takes O(n*n) time

Correct Answer : Option (A) :   When elements are sorted in ascending order