A: 15
B: 31
C: 62
D: 242
举一反三
- In a 5-level B tree with a height of 2, the number of keywords contained is at least () A: 5 B: 7 C: 8 D: 14
- In a 4-level B tree with 15 keywords, the maximum number of nodes containing keywords is () A: 5 B: 6 C: 10 D: 15
- 高度为 5 的 3 阶 B-树含有的关键字个数至少是（ ）。 A: 15 B: 31 C: 62 D: 242
- 高度为5的3阶B树含有的关键字个数至少是多少？ A: 15 B: 31 C: 62 D: 242
- level() A: the desire to learn, know, or take part in something. B: a number or other written symbol that is not a letter of the<br/>alphabet. C: position in height, stage, or rank. D: the act or process of adding.
内容
- 0
12 In the following sort algorithms, the sorting algorithm that is suitable for a large number of records keywords, but with a small number of keywords to be sorted is（ ）. A: cardinality sort B: quick Sort C: merge sort D: heap sort
- 1
News 3 Questions 5 to 7 will be based on the following news item. A: At least 17. B: At least 24. C: At least 21. D: At least 41.
- 2
创建一条弧线的函数是（ ）。 A: arc(number x, number y, number r, number sAngle, number eAngle, boolean counterclockwise) B: rect(number x, number y, number width, number height) C: arcTo(number x1, number y1, number x2, number y2, number radius) D: fillRect(number x, number y, number width, number height)
- 3
A signal s(t)=3cos(20pt) V is quantized by a uniform quantizer, the step size of the quantizer is 0.1V, then the minimal number of quantization level is Lmin=_______, the number of bits per sample is at least Rmin=_______, and the variance of the quantization error is _________V^2.
- 4
A bag contains 3 red, 4 white, and 5 blue marbles. Jason begins removing marbles from the bag at random, one at a time. What is the least number of marbles he must remove to be sure that he has at least one of each color.（） A: 3 B: 6 C: 8 D: 10 E: 12