题库 第6490页
If the preorder and the postorder traversal sequences of a binar
If the preorder and the postorder traversal sequences of a binary tree have exactly the opposite orders, then none of th…
用3条磁带对55个有序段做2路归并，初始的段分配成（34，21）比分配成（30，25）要好。
用3条磁带对55个有序段做2路归并，初始的段分配成（34，21）比分配成（30，25）要好。~@[](2)答案：TRUE…
For a $$k$$-way merge we need at least $$2k$$ input buffers and
For a $$k$$-way merge we need at least $$2k$$ input buffers and $$k$$ output buffers for parallel operations. ~@[](1)答案：…
在外部排序中，$$k$$路归并被用于减少归并的趟数。只要有足够多的磁带，$$k$$越大越好。
在外部排序中，$$k$$路归并被用于减少归并的趟数。只要有足够多的磁带，$$k$$越大越好。~@[](2)答案：FALSE…
Let P be the shortest path from S to T. If the weight of every
Let P be the shortest path from S to T. If the weight of every edge in the graph is incremented by 1, P will still be t…
Let M be the minimum spanning tree of a weighted graph G. Then
Let M be the minimum spanning tree of a weighted graph G. Then the path in M between V1 and V2 must be the shortest pat…
In a weighted undirected graph, if the length of the shortest pa
In a weighted undirected graph, if the length of the shortest path from `X` to `Y` is 18, and there exists an edge of we…
Kruskal's algorithm is to maintain a forest and to merge two tre
Kruskal's algorithm is to maintain a forest and to merge two trees into one at each stage. ~@[](1)答案：TRUE…
- 搜索
-
- 最新文章
-
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)