下载APP
【单选题】
Why does Zachary think he can't be a good teacher?
A.
He doesn't like children.
B.
He thinks he is impatient.
C.
He thinks he can never understand children.
举报
参考答案:
参考解析:
刷刷题刷刷变学霸
举一反三
【单选题】Given the BST above, what is the result after a zig operation on node 19?对以上二叉搜索树,以节点19为轴进行一次zig操作后得到的树为:
A.
B.
C.
D.
查看完整题目与答案
【单选题】Where will Jessica and her friends visit during the weekend?
A.
The Temple of Heaven.
B.
The Tiananmen Square.
C.
The Olympic Park.
查看完整题目与答案
【单选题】We are ________ a survey to find out what our customers think of their local bus service.
A.
revealing
B.
identifying
C.
conducting
D.
indicating
查看完整题目与答案
【单选题】How does Zachary's friend talk with his friends?
A.
He chats with them online every day.
B.
He goes out and meets them.
C.
He seldom talks with his friends.
查看完整题目与答案
【单选题】For vectors of size n, the optimal and worst-case time complexity for merge sorting is: 对于规模为n的向量,归并排序的最优、最坏时间复杂度分别为:
A.
$\Theta(n),\Theta(nlog_2n)$
B.
$\Theta(nlog_2n),\Theta(nlog_2n)$
C.
$\Theta(nlog_2n),\Theta(n^2)$
D.
$\Theta(n),\Theta(n^2)$
查看完整题目与答案
【判断题】“尼米兹”级航母拥有70~80架舰载机,其中包括:8架S-3“北欧海盗”反潜机,4架E-2C或E-2D预警机,4架EA-6B或EA-18G电子战飞机,6架SH-60海鹰多用途直升机,还有50多架F/A-18/E/F或F-35C战斗/攻击机。
A.
正确
B.
错误
查看完整题目与答案
【单选题】What is the time complexity for searching in an AVL tree with n nodes?在包含n个节点的AVL树中进行查找的时间复杂度为
A.
O(1)
B.
O(lgn)
C.
O(n)
D.
O(nlgn)
查看完整题目与答案
【单选题】Drugs can slow down the ________ of the disease.
A.
foundation
B.
program
C.
profile
D.
progression
查看完整题目与答案
【判断题】提康德罗加级巡洋舰共27艘,首舰开始服役于1983年,目前该级舰有些已经退役。除了托马斯·盖兹号外,全部的舰名都是以美国历史上著名的古战场为名,且其中有12艘继承了第二次世界大战的航母舰名。
A.
正确
B.
错误
查看完整题目与答案
【简答题】例3-3的程序中的arctan()函数,如果执行arctan(1/5.0),那么函数中while循环的循环体最后一次被执行后,i的值是多少填入符合题目要求的i的值(整数):__
查看完整题目与答案