Every time when I go back to my hometown, I usually spend two days ____ of my relatives.

答案查看网，轻松搜题/搜资源

【单选题】【消耗次数：1】

① going the rounds of

② rounding up

③ making the rounds of

④ rounding on

参考答案：

复制

纠错

相关题目

【单选题】 When I was a child, I_______go back home on time.

① have to

② must

③ had to

查看完整题目与答案

【单选题】 This photo reminds me ___ the days when I worked ___ the farm with my classmates.

① ?about; in

② ?of; on

③ ?of; in

④ ?about; on

查看完整题目与答案

【单选题】 I fell and broke my leg when I_______riding my bike.

① /

② is

③ was

查看完整题目与答案

【单选题】 I will take my daughter with me when I __________ Shanghai.

① go to

② will go to

③ have been to

④ have gone to

查看完整题目与答案

【单选题】 I will take my daughter with me when I_______ Shanghai.

① go to

② will go to

③ have been to

④ have gone to

查看完整题目与答案

【单选题】 I sprained my ankle when I _______ running in the street.

① is

② was

③ /

查看完整题目与答案

【单选题】 My grandfather had suffered from cancer for two years. It was no surprise when I was told that he had _____.

① passed off

② passed away

③ passed by

④ passed over

查看完整题目与答案

【单选题】 Thats pretty good that you get up and go running, but I ______ like running early in the morning since I’ve got to prepare breakfast for my family.

① have a good time

② have a hard time

③ have time

④ have much time

查看完整题目与答案

【单选题】 I haven’t finished my composition . I ________ for two hours and a half.

① have written it

② have been writing it

③ wrote it

④ am writing it

查看完整题目与答案

【单选题】 I ___ go to bed until I ___ finished my work last night.

① don’t; had

② didn’t; have

③ didn’t; had

④ don’t; have

查看完整题目与答案

随机题目

【单选题】二路归并排序的时间复杂度为（）。

① O(n)

② O(n2)

③ O(nlog2n)

④ O(1og2n)

查看完整题目与答案

【单选题】下列排序算法中时间复杂度不受数据初始状态影响，恒为O(n2)的是

① 堆排序

② 冒泡排序

③ 直接选择排序

④ 快速排序

查看完整题目与答案

【单选题】下列广义表是线性表的有

① E=(a,(b,c))

② E=(a,E)

③ E=(a,b)

④ E=(a,L);L=()

查看完整题目与答案

【单选题】设某有向图的邻接表中有n个表头结点和m个表结点，则该图中有（）条有向边。

① n

② n-1

③ m

④ m-1

查看完整题目与答案

【单选题】若有18个元素的有序表存放在一维数组A[19]中，第一个元素放A[1]中，现进行二分查找，则查找A［3］的比较序列的下标依次为()

① 1，2，3

② 9，5，2，3

③ 9，5，3

④ 9，4，2，3

查看完整题目与答案

【单选题】设一组权值集合W=(15，3，14，2，6，9，16，17)，要求根据这些权值集合构造一棵哈夫曼树，则这棵哈夫曼树的带权路径长度为（）。

① 129

② 219

③ 189

④ 229

查看完整题目与答案

【单选题】设无向图G中的边的集合E={(a，b)，(a，e)，(a，c)，(b，e)，(e，d)，(d，f)，(f，c)}，则从顶点a出发进行深度优先遍历可以得到的一种顶点序列为（）。

① aedfcb

② acfebd

③ aebcfd

④ aedfbc

查看完整题目与答案

【单选题】设指针q指向单链表中结点A，指针p指向单链表中结点A的后继结点B，指针s指向被插入的结点X，则在结点A和结点B插入结点X的操作序列为（）。

① s-next=p-next；p-next=-s

② q-next=s；s-next=p

③ p-next=s-next；s-next=p

④ p-next=s；s-next=q

查看完整题目与答案

【单选题】设二叉排序树上有n个结点，则在二叉排序树上查找结点的平均时间复杂度为（）。

① O(n)

② O(n2)

③ O(nlog2n)

④ O(1og2n)

查看完整题目与答案

【单选题】设有6个结点的无向图，该图至少应有()条边才能确保是一个连通图。

① 5

② 6

③ 7

④ 8

查看完整题目与答案