2024知到答案 数据结构（全英文） 最新智慧树满分章节测试答案
第一章 单元测试
1、单选题：
The algorithm and flowchart can help us to
选项：
A:Identify the data type of a variable
B:To know the memory capacity
C:To store the data
D:Specify the problem completely and clearly
答案: 【Specify the problem completely and clearly】
2、单选题：
The rhombus or diamond shape in flowcharting denotes
选项：
A:Initialization
B:Input
C:Output
D:Decision
答案: 【Decision】
3、单选题：
Which of the following is not an advantage of a flowchart?
选项：
A:Efficient coding
B:Improper documentation
C:Systematic testing
D:Better communication
答案: 【Improper documentation】
4、单选题：
The flowchart symbols used for start and stop operations are called as_______.
选项：
A:processing
B:decision
C:connectors
D:terminals
答案: 【terminals】
5、单选题：
The formula Fn = Fn-1+Fn-2 will produce
选项：
A:Prime Number
B:Euler Number
C:Fibonacci Number
D:Ramanujan Number
答案: 【Fibonacci Number】
6、单选题：
The main measures for the efficiency of an algorithm are
选项：
A:Processor and memory
B:Data and space
C:Complexity and capacity
D:Time and space
答案: 【Time and space】
7、单选题：
Which one of the following is the constant time complexity in terms of Big-Oh notation
选项：
A:O(n)
B:O(n3)
C:O(n2)
D:O(1)
答案: 【O(1)】
8、单选题：
What is the time complexity of the following code? int a=0; for(i=0;i<n;i++){ for(j=n;j>i;j--){ a=a+i+j;}}
选项：
A:O(1)
B:O(n2)
C:O(nlogn)
D:O(n)
答案: 【O(n2)】
9、单选题：
Which one of the following is an example for exponential time complexity?
选项：
A:O(2n)
B:O(1)
C:O(n)
D:O(n2)
答案: 【O(2n)】
10、单选题：
For larger values of n, which one represents the slowest time?
选项：
A:O(n)
B:O(n!)
C:O(n2)
D:O(2n)
答案: 【O(n!)】
第二章 单元测试
1、单选题：
Deletion of an element from the array reduces the size of array by ___________.
选项：
A:two
B:one
C:zero
D:three
答案: 【one】
2、单选题：
Assuming that int is of 4 bytes, what is the size of int arr[10];?
选项：
A:40
B:20
C:30
D:10
答案: 【40】
3、单选题：
Two dimensional arrays are useful when the elements being processed are to be arranged in the form of ___________.
选项：
A:columns
B:Both (a) and (b)
C:rows
D:None of the above
答案: 【Both (a) and (b)】
4、单选题：
In the polynomial, A(x)= 3x2+2x+4, the degree of this polynomial is
选项：
A:2
B:0
C:1
D:3
答案: 【2】
5、单选题：
In the polynomial, A(x)= 3x2+2x+4, coefficient of first term is
选项：
A:2
B:0
C:3
D:1
答案: 【3】
6、单选题：
A matrix having a larger number of elements with zero values than the number of non-zero elements is said to be a_____________.
选项：
A:sparse matrix
B:zero matrix
C:triangular matrix
D:diagonal matrix
答案: 【sparse matrix】
7、单选题：
While representing the sparse matrix A (m×n) with t non-zero terms in 3-tuples form, the size of the matrix becomes
选项：
A:(t+1) × 3
B:m × n
C:3 × t
D:t × n
答案: 【(t+1) × 3】
8、单选题：
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:
选项：
A:m
B:n
C:n+t
D:t
答案: 【n】
9、单选题：
Considering a sparse of m×n matrix with t non-zero terms, the time complexity of TRANSPOSE algorithm is:
选项：
A:O(n-t)
B:O(n*t)
C:O(n+t)
D:O(nt)
答案: 【O(n*t)】
10、单选题：
Which of the following statement is true regarding TRANSPOSE and FAST_TRANSPOSE algorithms.
选项：
A:The TRANSPOSE algorithm is slower than FAST_TRANSPOSE
B:Time complexities of TRANSPOSE and FAST_TRANSPOSE are same
C:None of the above
D:The TRANSPOSE algorithm is faster than FAST_TRANSPOSE
答案: 【The TRANSPOSE algorithm is slower than FAST_TRANSPOSE】