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

题库 第6488页

  • 最新
  • 浏览
  • 评论

During the sorting, processing every element which is not yet at

Luz5年前 (2021-05-10)2425
During the sorting, processing every element which is not yet at its final position is called a "run". To sort a list of…

During the sorting, processing every element which is not yet at

Luz5年前 (2021-05-10)1902
During the sorting, processing every element which is not yet at its final position is called a "run". To sort a list of…

In a binary tree, if node A is an ancestor of node B, then A mus

Luz5年前 (2021-05-10)1323
In a binary tree, if node A is an ancestor of node B, then A must precede B in the inorder traversal sequence. ~@[](1)答…

For binary heaps with $$N$$ elements, the *BuildHeap* function (

Luz5年前 (2021-05-10)1172
For binary heaps with $$N$$ elements, the *BuildHeap* function (which adjust an array of elements into a heap in linear…

During finding all articulation points in a connected graph, if

Luz5年前 (2021-05-10)1070
During finding all articulation points in a connected graph, if v1 is the parent of v2 in the depth-first tree, Num(v1)…

In a binary tree, if node A is a descendant of node B, A may pr

Luz5年前 (2021-05-10)1072
In a binary tree, if node A is a descendant of node B, A may precede B in the inorder traversal sequence. ~@[](1)答案:TR…

The size estimate for a software product to be built must be bas

Luz5年前 (2021-05-10)891
The size estimate for a software product to be built must be based on a direct measure like LOC. ~@[](1) 答案:FALSE…

If graph G has a cycle, then G does not have a topological sorti

Luz5年前 (2021-05-10)1050
If graph G has a cycle, then G does not have a topological sorting sequence. ~@[](2)答案:TRUE…

Let S be the set of activities in Activity Selection Problem. Th

Luz5年前 (2021-05-10)933
Let S be the set of activities in Activity Selection Problem. The greedy rule of "collecting the activity that starts th…

In the Turnpike Reconstruction Problem, given the distance set D

Luz5年前 (2021-05-10)1091
In the Turnpike Reconstruction Problem, given the distance set D = { 1, 2, 2, 3, 4, 4, 5, 5, 7, 9 }, there must be a tol…