1. Adding more children per node in a search tree, ______. a. increases the numb

Question

1. Adding more children per node in a search tree, ______. a.  increases the number of comparisons at each node during the search for a value b.  increases the number of the roots of the tree c.  reduces the number of records that a node can contain d.  increases the height of the search tree 2. In a B-tree of degree 5, an internal node (other than the root) has at most ______. a.  1 child b.  2 children c.  4 children d.  5 children 3. Which of the following is NOT a required step for a deletion operation under external hashing of an index file? a.  search the index file for the index record b.  search the data file for the block of the data record c.  delete the index record from the index file d.  delete the data record from the data file 4. One of the simplest external table implementations stores the records in order by their ______. a. value b. priority c. search key d. name 5. When the index file is organized as an external 2-3 tree, a leaf will contain ______. a.  two child pointers with the value -1 b.  three child pointers with the value -1 c.  two child pointers with the value null d.  three child pointers with the value null 6. In a B-tree of degree 5, an internal node (other than the root) has at least ______. a.  1 child b.  2 children c.  3 children d.  4 children 7. An index file reduces the number of the required block accesses for table operations. a.  True b.  False 8. In general, an index record is the same size as a data record. a.  True b.  False 9. If a node in a search tree is to have m children, it must contain ______ key values to separate the values in its subtrees correctly. a. m b. m - 1 c. m + 1 d. m - 2 10. In an external table implementation in which data records are stored in search-key order, the tableRetrieve algorithm requires that you know ______ in a data-file segment. a.  the number of the first block b.  the number of the first and last blocks c.  the number of the middle block d.  the number of the last block 11. In a B-tree of degree 5, the root has at least ______. a.  1 child b.  2 children c.  3 children d.  4 children 12. In an external environment, the advantage of making a search tree ______ by allowing more children per node outweighs the disadvantage. a.  full b.  dense c.  short d.  tall 13. The records of a data file are organized into one or more ______. a. rows b. columns c. arrays d. blocks 14. A random access file resembles a(n) ______ in terms of the operations that are permitted on such a file. a.  linked list b.  array c.  queue d.  stack 15. In a B-tree of degree 5, the root has at least ______ record(s). a.  1 b.  2 c.  3 d.  4 1. Adding more children per node in a search tree, ______. a.  increases the number of comparisons at each node during the search for a value b.  increases the number of the roots of the tree c.  reduces the number of records that a node can contain d.  increases the height of the search tree 2. In a B-tree of degree 5, an internal node (other than the root) has at most ______. a.  1 child b.  2 children c.  4 children d.  5 children 3. Which of the following is NOT a required step for a deletion operation under external hashing of an index file? a.  search the index file for the index record b.  search the data file for the block of the data record c.  delete the index record from the index file d.  delete the data record from the data file 4. One of the simplest external table implementations stores the records in order by their ______. a. value b. priority c. search key d. name 5. When the index file is organized as an external 2-3 tree, a leaf will contain ______. a.  two child pointers with the value -1 b.  three child pointers with the value -1 c.  two child pointers with the value null d.  three child pointers with the value null 6. In a B-tree of degree 5, an internal node (other than the root) has at least ______. a.  1 child b.  2 children c.  3 children d.  4 children 7. An index file reduces the number of the required block accesses for table operations. a.  True b.  False 8. In general, an index record is the same size as a data record. a.  True b.  False 9. If a node in a search tree is to have m children, it must contain ______ key values to separate the values in its subtrees correctly. a. m b. m - 1 c. m + 1 d. m - 2 10. In an external table implementation in which data records are stored in search-key order, the tableRetrieve algorithm requires that you know ______ in a data-file segment. a.  the number of the first block b.  the number of the first and last blocks c.  the number of the middle block d.  the number of the last block 11. In a B-tree of degree 5, the root has at least ______. a.  1 child b.  2 children c.  3 children d.  4 children 12. In an external environment, the advantage of making a search tree ______ by allowing more children per node outweighs the disadvantage. a.  full b.  dense c.  short d.  tall 13. The records of a data file are organized into one or more ______. a. rows b. columns c. arrays d. blocks 14. A random access file resembles a(n) ______ in terms of the operations that are permitted on such a file. a.  linked list b.  array c.  queue d.  stack 15. In a B-tree of degree 5, the root has at least ______ record(s). a.  1 b.  2 c.  3 d.  4

Explanation / Answer

1. Adding more children per node in a search tree, .

2. In a B-tree of degree 5, an internal node (other than the root) has at most ______.

d.  4 children

3. Which of the following is NOT a required step for a deletion operation under external hashing of an index file?

d.  delete the data record from the data file

4. One of the simplest external table implementations stores the records in order by their ______.

c. search key

5. When the index file is organized as an external 2-3 tree, a leaf will contain ______.

b.  three child pointers with the value -1

6. In a B-tree of degree 5, an internal node (other than the root) has at least ______.

b.  2 children

7. An index file reduces the number of the required block accesses for table operations.

a.  True

8. In general, an index record is the same size as a data record.

b.  False

9. If a node in a search tree is to have m children, it must contain ______ key values to separate the values in its subtrees correctly.

b. m - 1

a.  increases the number of comparisons at each node during the search for a value

Related Questions

Navigate

• Browse (All)
• Browse 1
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.