2026知到答案 算法设计与分析(浙江师范大学) 最新智慧树满分章节测试答案
第一章 单元测试
1、单选题:
Which of the following is the correct asymptotic bound for
? ( )
选项:
A:
B:
C:
D:
答案: 【
】
2、单选题:
Let
where
is a constant. What is the asymptotic bound of
? ( )
选项:
A:
B:
C:
D:
答案: 【
】
3、判断题:
There are 131 students and 52 weeks in a year. By the pigeonhole principle, is it true that at least one week must contain at least 3 students’ birthdays? ( )
选项:
A:错
B:对
答案: 【对】
4、单选题:
The following algorithm evaluates a polynomial
by iterating from
down to 0: y = a[i] + x * y. What is the time complexity of this algorithm? ( )
选项:
A:
B:
C:
D:
答案: 【
】
5、单选题:
What is the asymptotic solution to
? ( )
选项:
A:
B:
C:
D:
答案: 【
】
第二章 单元测试
1、单选题:
Given two sorted lists of sizes
and
, what is the time complexity of computing the
-th smallest element in their union? ( )
选项:
A:
B:
C:
D:
答案: 【
】
2、单选题:
What is the result of multiplying the binary numbers
and
using the divide-and-conquer integer multiplication algorithm?( )
选项:
A:
B:
C:
D:
答案: 【
】
3、单选题:
What is the fast Fourier transform of the vector
? ( )
选项:
A:
B:
C:
D:
答案: 【
】
4、单选题:
What is the time complexity of the best algorithm to determine if there exist two integers in a set
of
integers whose sum is exactly
? ( )
选项:
A:
B:
C:
D:
答案: 【
】
5、单选题:
What is the result of multiplying the polynomials
and
using the FFT method? ( )
选项:
A:
B:
C:
D:
答案: 【
】
6、判断题:
There exists an
time divide-and-conquer algorithm to find an index
in a sorted array of distinct integers such that
. ( )
选项:
A:对
B:错
答案: 【对】
本门课程剩余章节答案为付费内容
支付后可长期查看
有疑问请添加客服QQ:2025479448反馈
购买期末请+QQ:2025479448
如遇卡顿看不了请换个浏览器即可打开
请看清楚了再购买哦,电子资源购买后不支持退款哦
