MCQ Quiz - Data Structures - B-Trees
* Required
Name
Your answer
Organisation name
Your answer
Full Address
Your answer
Email-Id (The score will be emailed to you)
*
Your answer
Q1.There is a situation where it is not possible to store the whole data in primary storage and access to secondary storage is comparatively expensive then the ideal data structure in this case is
B-Tree
AVL Tree
Binary tree
Binary search Tree
Q2. The following insertions are made to an initially empty B-tree of order 5 1,12,8,2,25,5,14,28,17 now the root node contains the element/elements
8
1
8,17
1,2
Q3.A B-Tree of order 5 is constructed by inserting the elements in the given order 1,12,8,2,25,5,14,28,17,7,52,16,48 then the value of r[1]-c1[1] is (where r represents the root and c1 represents the first child of the root)
7
6
8
1
Q4.From the above Tree if the elements 14 and 16 are deleted then what are the contents of the root node
8,12
8,25
7,17
either b or c
Q5.A is a B-Tree of minimum degree 2 and D is a B-Tree of minimum degree 4 there are 15 nodes in each then which of the following is true
height of D > height of A
height of D < height of A
height of D = height of A
None of the above
Q6.Which of the following is true
There can be a B-Tree of minimum degree t=1
AVL Tree is comparatively better than B-Tree in database and file system
A B-Tree of order m(m way) has m-1 keys in its node
2-3 tree is an example for AVL Tree
Q7.A B-Tree of order 5 has an height of 2 then what is the maximum number of nodes present in it
124
126
24
26
Q8.A Tree data structure with the following properties is.. -keeps keys in sorted order for sequential traversing -keeps the index balanced with an elegant recursive algorithm -uses partially full blocks to speed up insertions and deletions
B-Tree
BST
AVL
Threaded binary trees
Q9.Which of the following is/are true.. a) All the leaves are at the same level in a B-Tree b) A leaf node can contain more than m-1 keys c) All non-leaf nodes except the root have at least ⌠m/2˥ children d) A B-Tree of m-order has m-2 keys
Only a
Onlyb
both a and c
both a and d
Q.10.Searching an indexed and unsorted database containing n key values and searching an indexed and unsorted database will have running times of
O(n) and O(log n)
O(log n) and O(n)
O(log n) and O(n log n)
O(n) and O(n log n)
Submit
Never submit passwords through Google Forms.
Forms
This content is neither created nor endorsed by Google.
Terms of Service