当前位置：首页
> Luz 第6666页
Luz 管理员
暂无介绍
89859 篇文章 33 次评论If only one tape drive is available to perform the external sort
If only one tape drive is available to perform the external sorting, then the tape access time for any algorithm will be…
If there are 81 runs to be merged using 4 taps for 3-way merges,
If there are 81 runs to be merged using 4 taps for 3-way merges, then distributing the runs unevenly as (12, 24, 45) wil…
The bottleneck of external sorting is to merge the records from
The bottleneck of external sorting is to merge the records from input buffers to the output buffers. ~@[](1)答案：FALSE…
Replacement selection is a method for generating longer runs in
Replacement selection is a method for generating longer runs in external sorting. ~@[](1)答案：TRUE…
Polyphase merge is a method for speeding up k-way merge in exter
Polyphase merge is a method for speeding up k-way merge in external sorting. ~@[](1)答案：FALSE…
To find the top 3 largest keys from 50 keys, selection sort runs
To find the top 3 largest keys from 50 keys, selection sort runs faster than heap sort. ~@[](2)答案：TRUE…
In external sorting, a $$k$$-way merging is usually used in orde
In external sorting, a $$k$$-way merging is usually used in order to reduce the number of passes and we will take the $$…
If there are 105 runs to be merged using 4 taps for 3-way merges
If there are 105 runs to be merged using 4 taps for 3-way merges, then distributing the runs unevenly as (17, 32, 56) wi…
If in a directed graph, every vertex is part of some cycle, then
If in a directed graph, every vertex is part of some cycle, then the graph must be strongly connected. ~@[](2)答案：FALSE…
If an undirected graph with 4 vertices is stored in a 1-D array
If an undirected graph with 4 vertices is stored in a 1-D array `G[]` as the following: ``` G[] = { 0, 1, 0, 1, 1, 0, 0,…