【多选题】【消耗次数:1】
I_____________ that she is over forty.
guess
think
imagine
suppose
参考答案:
复制
纠错
相关题目
【单选题】 —Look, someone is coming. Guess who it ___ be?—I think it ___ be Tom.—I don’t think it ___ be ___.
①  ?must; can; must; his
②  ?may; can; must; him
③  ?can; must; can; him
④  ?might; must; can; himself
【单选题】 Look,someone is coming. Guess who it_________be?I think it______be Tom.I dont think it______be_______.
①  must;can;must;his
②  may;can;must;him
③  can;must;can;him
④  might;must;can;himself
【单选题】 6. –Look, someone is coming. Guess who it _____ be?–I think it _____ be Tom.–I don’tthink it _____ be _____.
①  must; can; must; his
②  may; can; must; him
③  must; can; him
④  might; must; can; himself
【单选题】 My cousin Nancy is often in a poisonous mood; I suppose it’s because she is _____child.
①  one
②  a lone
③  a single
④  an only
【单选题】 19. — You cant finish the book in less than an hour,I suppose? —
①  Yes,ImsureIcan
②  No,hardly
③  Sorry,Icant
④  IdontthinkIcan
【单选题】 She put an extra blanket over the baby for fear that ____.
①  he catches cold
②  he should catch cold
③  he caught cold
④  he be catching cold
【单选题】 She put an extra blanket over the baby for fear that _____.
①  he catches cold
②  he should catch cold
③  he caught cold
④  he be catching cold
【单选题】 It is ____ with the customer not to let the shop assistants guess what she really likes and wants until the last moment.
①  in her honor
②  on her honor
③  a point of honor
④  an honor
【单选题】 It is _____ with the customer not to let the shop assistants guess what she really likes and wants until the last moment.
①  in her honor
②  on her honor
③  a point of honor
④  an honor
【判断题】 A: What do you think of these skirts? B: I think nothing.
①  正确
②  错误
随机题目
【单选题】 设有6个结点的无向图,该图至少应有()条边才能确保是一个连通图。
①  5
②  6
③  7
④  8
【单选题】 若线性表最常用的操作是存取第i个元素的值,则采用_______存储方式节省时间。
①  单链表
②  双链表
③  单循环链表
④  顺序表
【单选题】 设指针变量front表示链式队列的队头指针,指针变量rear表示链式队列的队尾指针,指针变量s指向将要入队列的结点X,则入队列的操作序列为()。
①  front-next=s;front=s;
②  s-next=rear;rear=s;
③  rear-next=s;rear=s;
④  s-next=front;front=s;
【单选题】 设s1=“”,则strlen(s1)的值是
①  0
②  1
③  2
④  3
【单选题】 在n个结点的顺序表中,算法的时间复杂度是O(1)的操作是
①  访问第i个结点(1≤i≤n)
②  在第i个结点后插入一个新结点(1≤i≤n)
③  删除第i个结点(1≤i≤n)
④  将n个结点从小到大排序
【单选题】 具有n个结点的完全二叉树的深度为
①  「log2n」+1
②  log2n+1
③  log2n
④  「log2n」
【单选题】 设二叉树的先序遍历序列和后序遍历序列正好相反,则该二叉树满足的条件是()。
①  空或只有一个结点
②  高度等于其结点数
③  任一结点无左孩子
④  任一结点无右孩子
【单选题】 在所有排序方法中,关键字比较的次数与记录的初始排列次序无关的是
①  希尔排序
②  冒泡排序
③  插入排序
④  选择排序
【单选题】 用某种排序方法对线性表(25,87,21,47,15,27,63,35,20)进行排序时,元素序列的变化情况如下:(1)25,87,21,47,15,27,63,35,20(2)20,15,21,25,47,27,63,35,87(3)15,20,21,25,35,27,47,63,87(4)15,20,21,25,27,35,47,63,87则采用的排序方法是___________排序长度为4。
①  交换排序法
②  选择排序法
③  插入排序
④  选择排序
【单选题】 ()二叉排序树可以得到一个从小到大的有序序列。
①  先序遍历
②  中序遍历
③  后序遍历
④  层次遍历