题目内容

12 The number of elements in array A[0...4,-1...-3,5...7] is ( ).

A. 45
B. 55
C. 36
D. 16

查看答案

搜索结果不匹配？点我反馈

更多问题

13 Each element of the array A[0...5,0...6] occupies 5 bytes, and it is stored in column-major order in memory whit a starting address of 1000, then the address of element A[5,5] is ( ).

A. 1175
B. 1180
C. 1205
D. 1210

查看答案

14 In triple sequence table of sparse matrix, each triple represents ( ).

A. the row number,column number and data value of non-zero elements in the matrix
B. the data value of non-zero elements in the matrix
C. the row and column numbers of elements in the matrix
D. the row number,column number and data value of elements in the matrix

查看答案

15 After compressing and storing the following matrix, it is ( ) that loses the random access function.

A. sparse matrix
B. symmetric matrix
C. triangular matrix
D. tridiagonal matrix

查看答案

1 The most suitable structure for a tree is ().

A. Structure with branches and hierarchical relationships between elements
B. Ordered structure between element
C. Disordered structure between elements
D. Unconnected structure

查看答案

12 The number of elements in array A[0...4,-1...-3,5...7] is ( ).

A. 45 B. 55 C. 36 D. 16

13 Each element of the array A[0...5,0...6] occupies 5 bytes, and it is stored in column-major order in memory whit a starting address of 1000, then the address of element A[5,5] is ( ).

14 In triple sequence table of sparse matrix, each triple represents ( ).

15 After compressing and storing the following matrix, it is ( ) that loses the random access function.

1 The most suitable structure for a tree is ().

A. 45
B. 55
C. 36
D. 16