题目
A. the kind of OSPF areas being implemented
B. the number of external LSAs in the network
C. the number of DRs and BDRs in the areas
D. the number of virtual links in the areas
E. how well the areas can be summarized
F. the use of LSA filters
第1题
A. Only one I/O calibration process can run at a time.
B. It automates the resource allocation for the Automated Maintenance Tasks.
C. It improves the performance of the performance-critical sessions while running.
D. It can be used to estimate the maximum number of I/Os and maximum latency time for the system.
E. The latency time is computed only when the TIMED_STATISTICS initialization parameter is set to TRUE.
第2题
A. {A; B; C}
B. 所有年龄段的人都投身到了社区服务的事业中,其中年轻人最多。
C. 所有年龄段的人都把最多的青春献给了社区服务。
D. 所有年龄段的人和很多年轻人都投身到了社区服务的事业中。
第3题
● Every valid character in a computer that uses even (71) must always have an even number of1bits.
(71)A. parity B. check C. test D. compare
● The maximum number of data that can be expressed by 8 bits is (72) .
(72)A. 64 B. 128 C. 255 D. 256
● Integration (73) is the process of verifying that the components of a system work together as described in the program design and system design specifications.
(73)A. trying B. checking C. testing D. coding
● GIF files are limited to a maximum of 8 bits/pixel, it simply means that no more than 256 colors are allowed in (74) .
(74)A. an image B. a file C. a window D. a page
● Computer (75) is a complex consisting of two or more connected computing units, it is used for the purpose of data communication and resource sharing.
(75)A. storage B. device C. network D. processor
第4题
阅读以下说明和C函数,填充函数中的空缺,将解答填入答题纸的对应栏内。
【说明】
下面的函数sort(int n,int a[])对保存在数组a中的整数序列进行非递减排序。由于该
序列中的元素在一定范围内重复取值,因此排序方法是先计算出每个元素出现的次数并
记录在数组b中,再从小到大顺序地排列各元素即可得到一个非递减有序序列。例如,
对于序列6,5,6,9,6,4,8,6,5,其元素在整数区间[4,9]内取值,因此使数组元素b[O]~b[5]的下标O~5分别对应数值4~9,顺序地扫描序列的每一个元素并累计其出现的次数,即将4的个数记入b[0],5的个数记入b[l],依此类推,9的个数记入b[5]。最后依
次判断数组b的每个元素值,并将相应个数的数值顺序地写入结果序列即可。
对于上例,所得数组b的各个元素值如下:
那么在输出序列中写入1个4、2个5、4个6、1个8、1个9,即得4,5,5,6,6,6,6,8,9,
从而完成排序处理。
【C函数】
void sort(int n,int a[])
(int *b;
int i, k, number;
int minimum=a[0], maximum=a 0];
/.minimum和maximum分别表示数组a的最小、最大元素值*/
For(i=1;i<n;i++) {
if (_(1) ) minimum = a[j];
else
if (_ (2) ) maximum = a[i];
}
number = maximum - minimum + 1;
if (number<=l) return;
b = (int *) calloc (number, sizeod (int) ;
if (!b) return;
for(f=0;i<n,i++){/*计算数组a的每个元素值出现的次数并记入数组b*/
k= a[i] - minimum; ++b[k];
}
/*按次序在数组a中写入排好的序列*/
l= (3) ;
for(k=0; k<number; k++)
for(; (4) ;一一b[k] )
a[i++】=minimum+ (5)’ ;
}
第5题
The maximum number of data that can be expressed by 8 bits is ______.
A.64 B.128 C.255 D.256
第6题
The maximum number of dara that can be expressed by 8 bis is(72).
A.64
B.128
C.255
D.256
第10题
The maximum number of data that can be expressed by 8 bits is(72).(72)
A.64
B.128
C.255
D.256
第11题
A.0
B. 1
C. 2
D. 3
为了保护您的账号安全,请在“赏学吧”公众号进行验证,点击“官网服务”-“账号验证”后输入验证码“”完成验证,验证成功后方可继续查看答案!