怠揪露呛上前辨化哗衔淬踌承
灭篡署射皇貌缮详耐凭茂澎翅
●▂●
第一章 单元测试
1、单选题：
The algorithm and flowchart can help us to
A:To know the memory capacity
B:Identify the data type of a variable
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:Decision
B:Initialization
C:Input
D:Output
答案: Decision
3、单选题：
Which of the following is not an advantage of a flowchart?
A:Better communication
B:Efficient coding
C:Systematic testing
D:Improper documentation
答案: Improper documentation
4、单选题：
The flowchart symbols used for start and stop operations are called as_______.
A:decision
B:processing
C:terminals
D:connectors
答案: terminals
5、单选题：
The formula Fn = Fn-1+Fn-2 will produce
A:Prime Number
B:Euler Number
C:Ramanujan Number
D:Fibonacci Number
答案: Fibonacci Number
6、单选题：
The main measures for the efficiency of an algorithm are
A:Processor and memory
B:Complexity and capacity
C:Time and space
D:Data 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(n2)
C:O(1)
D:O(n3)
答案: O(1)
8、单选题：
What is the time complexity of the following code?
int a=0;
for(i=0;i
for(j=n;j>i;j–){
a=a+i+j;}}
A:O(n)
B:O(nlogn)
C:O(1)
D:O(n2)
答案: O(n2)
9、单选题：
Which one of the following is an example for exponential time complexity?
A:O(n)
B:O(2n)
C:O(1)
D:O(n2)
答案: O(2n)
10、单选题：
For larger values of n, which one represents the slowest time?
A:O(n)
B:O(2n)
C:O(n!)
D:O(n2)
答案: O(n!)
第二章 单元测试
1、单选题：
Deletion of an element from the array reduces the size of array by ___________.
A:one
B:two
C:three
D:zero
答案: one
2、单选题：
Assuming that int is of 4 bytes, what is the size of int arr[10];?
A:10
B:20
C:30
D:40
答案: 40
3、单选题：
Two dimensional arrays are useful when the elements being processed are to be arranged in the form of ___________.
A:rows
B:columns
C:Both (a) and (b)
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:0
B:1
C:2
D:3
答案: 2
5、单选题：
In the polynomial, A(x)= 3x2+2x+4, coefficient of first term is
A:0
B:1
C:2
D:3
答案: 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: diagonal matrix
B: sparse matrix
C: triangular matrix
D: zero 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:m × n
B:t × n
C:(t+1) × 3
D:3 × t
答案: (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:n
B:t
C:m
D:n+t
答案: n
9、单选题：
Considering a sparse of m×n matrix with t non-zero terms, the time complexity of TRANSPOSE algorithm is:
A:O(nt)
B:O(n-t)
C:O(n*t)
D:O(n+t)
答案: O(n*t)
10、单选题：
Which of the following statement is true regarding TRANSPOSE and FAST_TRANSPOSE algorithms.
A:
The TRANSPOSE algorithm is faster than FAST_TRANSPOSE
B:The TRANSPOSE algorithm is slower than FAST_TRANSPOSE
C:
Time complexities of TRANSPOSE and FAST_TRANSPOSE are same
D:None of the above
答案: The TRANSPOSE algorithm is slower than FAST_TRANSPOSE
完整版答案需支付5元购买，完整答案是全部章节的课后答案。制作这些答案花费了很多心血，希望大家理解，如需购买请点击下方红字：
注意：完整答案是全部的课后答案，无期末答案！
萌面人优惠券
一键领取淘宝，天猫，京东，拼多多无门槛优惠券，购物省省省！
如需了解详情请点击下方红字：
萌面人优惠券APP下载
支持安卓，苹果，PC电脑等设备，可查看各种大学网课答案，可一键领取淘宝，天猫，京东，拼多多无门槛优惠券
详情请点击下方红字：
更多信息：如何找到本平台？
方法一：
点击下方红字，访问萌面人资料铺
方法二：
搜狗搜索：萌面人资料铺 认准域名：www.xuexianswer.com 或者域名：xuexianswer.com 点击进入
方法三：
打开手机微信，扫一扫下方二维码，关注微信公众号：萌面人APP
本公众号可查看各种网课答案，还可免费查看大学教材答案
点击这里，可查看公众号功能介绍
为了下次更快打开本网站，建议在浏览器添加书签收藏本网页。
添加书签方法：
1.电脑按键盘的Ctrl键+D键即可收藏本网页
2.手机浏览器可以添加书签收藏本网页
蹄伸穷钳添暇权强扑胁泄假谱
戒汲韧嗜嘘嫁晶碑怀魔鸽迁漓