当前位置：首页
> Luz 第6254页
Luz 管理员
暂无介绍
89860 篇文章 33 次评论单选题：以下程序的结果是
以下程序的结果是 @[C](2)```#include int main() { int k=2,m=4,n=6; int *pk=&k,*pm=&m,*p; *(p=&n)=*pk*(*pm); printf(“%d”,…
单选题：设有如下程序段
设有如下程序段```char s[20]="Beijing",*p; p=s;```则执行p=s;语句后，以下叙述正确的是 @[A](2)A. 可以用`*p`表示s[0]B. s数组中元素个数和p所指字符串长度相等C. s和p都是指针…
单选题：若有说明：`int n=2,*p=&n,*q=p;`则以下非法的赋值语句是
若有说明：`int n=2,*p=&n,*q=p;`则以下非法的赋值语句是 @[D](2)A. ` p=q;`B. `*p=*q;`C. `n=*q;`D. `p=n;`A.` p=q;`B.`*p=*q;`C.`n=*q;`D.`p=…
单选题：若有定义：`int x,*pb;`则在以下正确的赋值表达式是
若有定义：`int x,*pb;`则在以下正确的赋值表达式是 @[A](2)A. `pb = &x`B. `pb = x`C. `*pb = &x`D. `*pb = *x`A.`pb = &x`B.`pb = x`C.`*pb = &…
单选题：
Which one of the following is the data structure that is best rep…
单选题：Given the popping sequence of a stack as {1, 2, 3, 4, 5}. Among
Given the popping sequence of a stack as {1, 2, 3, 4, 5}. Among the following, the impossible pushing sequence is: @[C]…
单选题：Given the popping sequence of a stack as {a, b, c, d, e}. Among
Given the popping sequence of a stack as {a, b, c, d, e}. Among the following, the impossible pushing sequence is: @[B]…
单选题：A full tree of degree 4 is a tree in which every node other than
A full tree of degree 4 is a tree in which every node other than the leaves has 4 children. How many leaves does a ful…
单选题：A full tree of degree 3 is a tree in which every node other than
A full tree of degree 3 is a tree in which every node other than the leaves has 3 children. How many leaves does a full…
单选题：A full tree of degree 3 is a tree in which every node other than
A full tree of degree 3 is a tree in which every node other than the leaves has 3 children. How many leaves does a full…