知到答案数据结构（全英文）智慧树答案_2022年

第二章

Deletion of an element from the array reduces the size of array by ___________.
two

zero

three

答案:zero
Assuming that int is of 4 bytes, what is the size of int arr[10];?
答案:10
Two dimensional arrays are useful when the elements being processed are to be arranged in the form of ___________.
rows

Both (a) and (b)

columns

答案:columns
In the polynomial, A(x)= 3x2+2x+4, the degree of this polynomial is
答案:0
In the polynomial, A(x)= 3x2+2x+4, coefficient of first term is
答案:1
A matrix having a larger number of elements with zero values than the number of non-zero elements is said to be a_____________.
    sparse matrix

    triangular matrix

    diagonal matrix

答案: diagonal matrix
While representing the sparse matrix A (m×n) with t non-zero terms in 3-tuples form, the size of the matrix becomes
t × n

3 × t

m × n

答案:3 × t
Considering a sparse of m×n matrix with t non-zero terms, in FAST_TRANSPOSE algorithm, the size of one-dimensional array (S or T) is equal to:
答案:n
Considering a sparse of m×n matrix with t non-zero terms, the time complexity of TRANSPOSE algorithm is:
O(n*t)

O(n+t)

O(n-t)

答案:O(n-t)
Which of the following statement is true regarding TRANSPOSE and FAST_TRANSPOSE algorithms.

Time complexities of TRANSPOSE and FAST_TRANSPOSE are same

The TRANSPOSE algorithm is slower than FAST_TRANSPOSE

The TRANSPOSE algorithm is faster than FAST_TRANSPOSE

答案:The TRANSPOSE algorithm is faster than FAST_TRANSPOSE