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

题库 第6620页

  • 最新
  • 浏览
  • 评论

已知如下程序段:

Luz5年前 (2021-05-10)1294
已知如下程序段: int x = 10, y = 20, t = 0; if(x!=y) { t = x; x = y; y = t; } printf("%d,%d\n",x,y); 则程序输出结果为:20,10 ~@[](2)答案:T…

switch(x)中的x可以是整型、字符型或者浮点型变量

Luz5年前 (2021-05-10)6269
switch(x)中的x可以是整型、字符型或者浮点型变量 ~@[](2)答案:FALSE…

已知'A'的ASCII代码值为65,则'D'的ASCII代码值为68

Luz5年前 (2021-05-10)1368
已知'A'的ASCII代码值为65,则'D'的ASCII代码值为68 ~@[](2)答案:TRUE…

有时候,打开文件方式"w+"和"r+"具有同样的作用。

Luz5年前 (2021-05-10)1837
有时候,打开文件方式"w+"和"r+"具有同样的作用。~@[](1)答案:TRUE…

There exists a parallel algorithm to solve the maximum finding

Luz5年前 (2021-05-10)886
There exists a parallel algorithm to solve the maximum finding problem with $$T(n) = O(1) $$ and $$ W(n) = O( n^{8/7}…

In a Red-Black Tree, if an internal black node is of degree 1, t

Luz5年前 (2021-05-10)1448
In a Red-Black Tree, if an internal black node is of degree 1, then it has only 1 descendant node.~@[](2)答案:TRUE…

For an AVL tree, all the balance factors of non-leaf nodes are 0

Luz5年前 (2021-05-10)833
For an AVL tree, all the balance factors of non-leaf nodes are 0 iff it is a complete binary tree. ~@[](2)答案:FALSE…

Zig & Zig-zig & Zig-zag rotations not only move the accessed nod

Luz5年前 (2021-05-10)901
Zig & Zig-zig & Zig-zag rotations not only move the accessed node to the root, but also roughly half the depth of most n…

In a Red-Black Tree, an internal red node is either a leaf or a

Luz5年前 (2021-05-10)767
In a Red-Black Tree, an internal red node is either a leaf or a node of degree 2. ~@[](2)答案:TRUE…

注释和效率

Luz5年前 (2021-05-10)862
注释和效率 过多的注释会影响程序的运行效率。 ~@[](1)答案:FALSE…