题库 第6509页
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,…
In a graph G, if we have to do BFS twice to visit every one of i
In a graph G, if we have to do BFS twice to visit every one of its vertices, then there must be two connected components…
The minimum spanning tree of a connected weighted graph with ver
The minimum spanning tree of a connected weighted graph with vertex set V={ A, B, C, D, E } and weight set W={ 1, 3, 2,…
- 搜索
-
- 最新文章
-
3分钟前
- Armbian 斐讯N1 盒子变成 Read-only File System
4个月前 (01-04)
4个月前 (12-13)
6个月前 (11-04)
5ire接入HexStrike AI MCP Agents报错Error Messages with role 'tool' must be a response to a preceding ...7个月前 (10-10)