-->
当前位置:首页 > 题库

题库 第1014页

  • 最新
  • 浏览
  • 评论

单选题:We have 4 tapes for 3-way external merge sorting. How shall we d

Luz4年前 (2022-06-30)646
We have 4 tapes for 3-way external merge sorting. How shall we distribute 31 runs into 3 tapes, such that the total num…

单选题:Which of the following binomial trees can represent a binomial q

Luz4年前 (2022-06-30)454
Which of the following binomial trees can represent a binomial queue of size 103?A.$$B_0B_1B_2B_3B_4B_6$$B.$$B_0B_1B_2B_…

单选题:Which of the following binomial trees can represent a binomial q

Luz4年前 (2022-06-30)606
Which of the following binomial trees can represent a binomial queue of size 167?A.$$B_0B_1B_3B_5B_7$$B.$$B_0B_1B_5B_6$$…

单选题:Delete the minimum number from the binomial queue given in the f

Luz4年前 (2022-06-30)639
Delete the minimum number from the binomial queue given in the following figure. Which one of the following statements m…

单选题:Delete the minimum number from the binomial queue given in the f

Luz4年前 (2022-06-30)416
Delete the minimum number from the binomial queue given in the following figure. Which one of the following statements m…

单选题:Which one of the following statements about the Maximum Finding

Luz4年前 (2022-06-30)674
Which one of the following statements about the Maximum Finding is False?A.It can be solved by summation algorithm with…

单选题:Which one of the following statements about the Maximum Finding

Luz4年前 (2022-06-30)665
Which one of the following statements about the Maximum Finding is False?A.It can be solved by summation algorithm with…

单选题:Which one of the following statements about the Ranking problem

Luz4年前 (2022-06-30)955
Which one of the following statements about the Ranking problem is TRUE? (Assume that both arrays contain $$N$$ elements…

单选题:Which one of the following statements about the Ranking problem

Luz4年前 (2022-06-30)741
Which one of the following statements about the Ranking problem is TRUE? (Assume that both arrays contain $$N$$ elements…

单选题:Insertion of B+ Tree

Luz4年前 (2022-06-30)706
To perform Insert on a B+ tree of order M, a node with M+1 keys will be split into 2 nodes.After inserting $$1, 2, 3, .…