第二章 Ordered Lists：introduce some about orderd lists2.1Introduction:introduce some operations on ordered lists and arrays[单选题]Deletion of an element from the array reduces the size of array by ___________.选项:[one
2.2Representation of Polynomials:introduce Representation of Polynomials
2.3Operations on Polynomials:introduce operations on polynomials and example equations
2.4Sparse Matrices:introduce some about Sparse Matrices
, zero
, two
, three
]
[单选题]Assuming that int is of 4 bytes, what is the size of int arr[10];?选项:[40, 30, 20, 10
]
[单选题]Two dimensional arrays are useful when the elements being processed are to be arranged in the form of ___________.选项:[rows
, None of the above
, Both (a) and (b)
, columns
]
[单选题] In the polynomial, A(x)= 3x2+2x+4, the degree of this polynomial is选项:[3, 1, 2, 0
]
[单选题] In the polynomial, A(x)= 3x2+2x+4, coefficient of first term is 选项:[0
, 2, 3, 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, zero matrix
, diagonal matrix
, triangular 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+1) × 3
, t × n
, 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+t, m, t, 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(nt)
]
[单选题]
Which of the following statement is true regarding TRANSPOSE and FAST_TRANSPOSE algorithms.
选项:[The TRANSPOSE algorithm is faster than FAST_TRANSPOSE, Time complexities of TRANSPOSE and FAST_TRANSPOSE are same, The TRANSPOSE algorithm is slower than FAST_TRANSPOSE
, None of the above
]
