D:Improper documentationA:0答案: Improper documentationB:1 C:2 D:3 答案: 2 D:Improper documentationA:0答案: Improper documentationB:1 C:2 D:3 答案: 2 2022-01-27 11
Which of the following is not an advantage of a flowchart?C:Both (a) and (b)A:Better communicationD:None of the above Which of the following is not an advantage of a flowchart?C:Both (a) and (b)A:Better communicationD:None of the above 2022-01-26 9
The algorithm and flowchart can help us to Deletion of an element from the array reduces the size of array by __________ The algorithm and flowchart can help us to Deletion of an element from the array reduces the size of array by __________ 2022-01-25 6
B:Identify the data type of a variableB:twoC:To store the dataC:three B:Identify the data type of a variableB:twoC:To store the dataC:three 2022-01-25 7
C:Time and space答案: (t+1) × 3D:Data and spaceConsidering a sparse of m×n matrix with t non-zero terms, in FAST_TRANSPOSE C:Time and space答案: (t+1) × 3D:Data and spaceConsidering a sparse of m×n matrix with t non-zero terms, in FAST_TRANSPOSE 2021-12-28 7
A:Processor and memoryC:(t+1) × 3B:Complexity and capacityD:3 × t A:Processor and memoryC:(t+1) × 3B:Complexity and capacityD:3 × t 2021-12-28 6
答案: Fibonacci NumberA:m × nThe main measures for the efficiency of an algorithm areB:t × n 答案: Fibonacci NumberA:m × nThe main measures for the efficiency of an algorithm areB:t × n 2021-12-27 3
C:Ramanujan Number答案: sparse matrixD:Fibonacci Number While representing the sparse matrix A (m×n) with t non-zero t C:Ramanujan Number答案: sparse matrixD:Fibonacci Number While representing the sparse matrix A (m×n) with t non-zero t 2021-12-27 6
A:Prime NumberC: triangular matrixB:Euler NumberD: zero matrix A:Prime NumberC: triangular matrixB:Euler NumberD: zero matrix 2021-12-27 6
D:connectors 答案: terminalsA: diagonal matrixThe formula Fn = Fn-1+Fn-2 will produceB: sparse matrix D:connectors 答案: terminalsA: diagonal matrixThe formula Fn = Fn-1+Fn-2 will produceB: sparse matrix 2021-12-26 6
B:processingB:1 C:2 D:3 答案: 3C:terminalsA matrix having a larger number of elements with zero values than the number of B:processingB:1 C:2 D:3 答案: 3C:terminalsA matrix having a larger number of elements with zero values than the number of 2021-12-25 6
A:O(n) C: B:O(nlogn) Time complexities of TRANSPOSE and FAST_TRANSPOSE are same A:O(n) C: B:O(nlogn) Time complexities of TRANSPOSE and FAST_TRANSPOSE are same 2021-11-22 6
C:O(1) D:None of the above D:O(n2) 答案: The TRANSPOSE algorithm is slower than FAST_TRANSPOSE C:O(1) D:None of the above D:O(n2) 答案: The TRANSPOSE algorithm is slower than FAST_TRANSPOSE 2021-11-22 8
答案: O(2n) For larger values of n, which one represents the slowest time? 答案: O(2n) For larger values of n, which one represents the slowest time? 2021-11-20 9
for(j=n;j>i;j–){ The TRANSPOSE algorithm is faster than FAST_TRANSPOSE a=a+i+j;}} B:The TRANSPOSE for(j=n;j>i;j–){ The TRANSPOSE algorithm is faster than FAST_TRANSPOSE a=a+i+j;}} B:The TRANSPOSE 2021-11-20 14
int a=0; Which of the following statement is true regarding TRANSPOSE and FAST_TRANSPOSE algorithms. for(i=0; int a=0; Which of the following statement is true regarding TRANSPOSE and FAST_TRANSPOSE algorithms. for(i=0; 2021-11-19 7
答案: O(1) D:O(n+t) What is the time complexity of the following code? 答案: O(n*t) 答案: O(1) D:O(n+t) What is the time complexity of the following code? 答案: O(n*t) 2021-11-17 12
答案: O(n2) Which one of the following is an example for exponential time complexity? 答案: O(n2) Which one of the following is an example for exponential time complexity? 2021-11-16 9
