填空题

[问题3] 能否产生“正确”结果但不可串行化的调度

【参考答案】

能够产生。

<上一题目录下一题>

热门试题

问答题

[说明] 计算下列源代码的McCabe环数，画出控制流程图并用罗马数字标出区域。read x，y，z；type =“scalene”；if (x= =y or x = = z or y= = z)type =“isosceles ”；if (x = = y and x = = z) type =“equilateral”；if (x＞= y+ z Or y＞= x+20rz＞=x+ y) type= “not a triangle”；if (x＜=0 or y＜= 0 or z ＜=0) type =“bad inputs”；print type；

填空题

[说明] 假设二叉树采用连接存储结构进行存储，root 指向根接点，p 所指结点为任一给定的结点，编写一个求从根结点到p所指结点之间路径的函数。void path (root, p)btree * root, * p;{Btree *stack[m0], *s;int tag[m0], top =0, i, find =0;s =root;do{while (s ! = NULL){stack [top] = s;tag[top] =0;( (1) )}if (top ＞0){( (2) )if (tag[top] = =1){if( (3) ){for (i=1; i＜ =top; i+ + printf ( %d ,stack[i]- ＞data);find=1;}else top - -;}if( (4) ){p=p- ＞right;( (5) )}}} while (find ｜｜ (s! = NULL && top ! =0));}

相关试题