按照压缩存储的思想，对于具有T个非零元素的M×N阶稀疏矩阵，可以采用三元组表存储方法存储，当T满足(45)关系时，这样做都有意义。
A．T＜M×N
B．T＜M×xN/3
C．T≤((M×N)/3-1
D．T＜(M×N)/3-1
有疑问？点此联系我们
收藏该题
查看答案
按照压缩存储的思想，对于具有T个非零元素的M×N阶稀疏矩阵，可以采用三元组表存储方法存储，当T满足(45)关系时，这样做都有意义。
A．T＜M×N
B．T＜M×xN/3
C．T≤((M×N)/3-1
D．T＜(M×N)/3-1
如果把由数转换得到的二叉树叫做这棵树对应的二叉树，下面结论中正确的是(11)。
A．树的先根遍历与其对应的二叉树的先根遍历相同
B．树的后根遍历与其对应的二叉树的后根遍历相同
C．树的先根遍历与其对应的二叉树的中根遍历相同
D．以上都不对
由数字1，2，3，4，5组成无重复数字的二位奇数个数是
A．5
B．8
C．10
D．12
A．into
B．off
C．onto
D．out
A basic premise of OGSA is that everything is(66)by a service: a network enabledentity that(67)some capability through the exchange of messages. Computational resources, storage resources, networks, programs, databases, and so forth are all(68). This adoption of auniform. service-oriented model means that all components of the environment are virtual. Morespecifically, OGSA represents everything as a Grid service: a Web service that conforms(69)a set of conventions and supports standard interfaces for such purposes as lifetime management. This core set of consistent interfaces, from which all Grid services are implemented.(70)the construction of hierarchical, higher - order services that can be treated in a uniform. way across layers of abstraction.
A．defined
B．represented
C．used
D．passed
某计算机字长32位，存储容量为1MB，若按字编址，其寻址范围是(3)。
A．0～1MW
B．0～512KB
C．0～256KW
D．0～256KB