1. B Trees are generally
A.  very deep and narrow B.  very wide and shallow C.  very deep and very wide D.  cannot say
2. A B-tree of minimum degree t can maximum _____ pointers in a node.
A.  t–1 B.  2t–1 C.  2t D.  t
3. Every internal node in a B-tree of minimum degree 2 can have
A.  2, 3 or 4 children B.  1, 2 or 3 children C.  2, 4 or 6 children D.  0, 2 or 4 children
4. In .............., it is possible to traverse a tree without using stacks either implicitly or explicitly.
A.  Threaded binary trees B.  AVL Tree C.  B+ tree D.  Heap
5. The order of a B-Tree with 2, 3, 4 or 5 children in every internal node is
A.  2 B.  3 C.  4 D.  5
6. The smallest number of key that will force a B-tree of order 3 to have a height 3 is
A.  5 B.  7 C.  12 D.  16
7. B+- trees are preferred to binary trees in databases because
A.  Disk access is much slower than memory Access B.  Disk capacities are greater than memory capacities C.  Disk data transfer rates are much less than memory data transfer rates D.  All of above