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

题库 第5996页

  • 最新
  • 浏览
  • 评论

单选题:执行以下程序,打印输出的内容是:

Luz5年前 (2021-05-10)1634
执行以下程序,打印输出的内容是: @[C](2)```#include int x=5, y=6;void incxy( ){ x++; y++;}int main( ){ int x=3; incxy( );…

单选题:执行以下程序,打印输出的内容是:

Luz5年前 (2021-05-10)1010
执行以下程序,打印输出的内容是: @[C](2)```#include int x=5, y=7;void swap( ){ int z; z=x; x=y; y=z;}int main( ){ int x=3,…

单选题:Which one of the following is the expression tree corresponding

Luz5年前 (2021-05-10)775
Which one of the following is the expression tree corresponding to the postfix expression `abc*+ef*+ `? @[A](3)A. ![59b…

单选题:以下名字,可以作为C语言标识符的是:

Luz5年前 (2021-05-10)785
以下名字,可以作为C语言标识符的是: @[C](2)A. student-1B. 205LabC. $aD. Car~2A.student-1B.205LabC.$aD.Car~2答案:C…

单选题:若想通过a&b来使a的二进制码中的首尾两位为原来的值,而其余为0,则b应为:(设变量a,b均占一个字节)

Luz5年前 (2021-05-10)1590
若想通过a&b来使a的二进制码中的首尾两位为原来的值,而其余为0,则b应为:(设变量a,b均占一个字节) @[B](2)A. 01111110B. 10000001C. 视a值而定D. 无法办到A.01111110B.10000001C…

单选题:下列程序的输出结果是:

Luz5年前 (2021-05-10)946
下列程序的输出结果是: @[C](2)```#include#define MA(x, y) (x)*(y)int main(){ int i = 2; i = 3/MA(i, i+2)+5; printf("…

单选题:To find the minimum spanning tree with Prim's algorithm for the

Luz5年前 (2021-05-10)1145
To find the minimum spanning tree with Prim's algorithm for the following graph, a sequence of vertexes 6, 1, 2, 3 was f…

单选题:The following is the part of depth-first search tree to find the

Luz5年前 (2021-05-10)680
The following is the part of depth-first search tree to find the articulation points, and the Num(v) value has been mark…

单选题:The maximum flow from v1 to v6 is ____

Luz5年前 (2021-05-10)694
The maximum flow from v1 to v6 is ____ @[B](2)![a.jpg](~/6c2c848b-760e-4eac-ab54-113279f4a2a2.jpg)A. 11 B. 12 C. 13…

单选题:The maximum flow from v1 to v6 is ____:

Luz5年前 (2021-05-10)634
The maximum flow from v1 to v6 is ____: @[A](2)![b.jpg](~/59067da2-bf01-44b3-b189-e4f5aadec03a.jpg)A. 11 B. 12 C. 13…