【单选题】【消耗次数:1】
He said that his sister ?[填空]been there one week before
had
has
have
will have
参考答案:
复制
纠错
相关题目
【单选题】 The sandwhich course, [填空]I have been on for a week ,is really excellent.
①  which
②  that
③  whose
④  who
【单选题】 Does Robert have [填空] computer? —Yes,he has [填空] .
①  an,some
②  a,one
③  a,/
④  any,one
【单选题】 He has been there, [填空]?
①  hasnt he
②  has he
③  does he
④  doesnt he
【单选题】 The hospital is said to have been ________________ in the Second World War.
①  declined
②  destroyed
③  decided
④  demanded
【单选题】 I hope ___ the little ___ I have been able to do has been of some use.
①  that; that
②  /; by which?
③  what; what
④  /; with which
【单选题】 To survive such an ( ) of a car crash, one has to have incredible luck.
①  collision
②  incident
③  occurrence
④  impact
【单选题】 He has been to Beijing . So [填空] I.
①  have
②  does
③  do
④  did
【单选题】 He might have been killed ____ the timely arrival of the ambulance.
①  but for
②  except for
③  besides
④  except
【单选题】 He might have been killed _____the timely arrival of the ambulance.
①  but for
②  except for
③  besides
④  except
【单选题】 He said that those books ?[填空] his.
①  was
②  is
③  were
④  are
随机题目
【单选题】 数据结构只是研究数据的逻辑结构和物理结构,这种观点( )。
①  正确
②  错误
③  前半句对,后半句错
④  前半句错,后半句对
【单选题】 在对n个元素进行直接插入排序的过程中,共需要进行( )趟。
①  n
②  n+1
③  n-1
④  2n
【单选题】 从具有n个结点的二叉排序树中查找一个元素时,在最坏情况下的时间复杂度为( )。
①  O(n)
②  O(1)
③  O(log2(n))
④  O(n的平方)
【单选题】 对具有n个元素的有序表采用折半查找,则算法的时间复杂度为( )。
①  O(n)
②  O(n的平方)
③  O(1)
④  O(log2(n))
【单选题】 对下列四个序列进行快速排序,各以第一个元素为基准进行第一次划分,则在该次划分过程中需要移动元素次数最多的序列为( )。
①  1, 3, 5, 7, 9
②  9, 7, 5, 3, 1
③  5, 3, 1, 7, 9
④  5, 7, 9, 1, 3
【单选题】 若根据查找表建立长度为m的哈希表,采用线性探测法处理冲突,假定对一个元素第一次计算的哈希地址为d,则下一次的哈希地址为( )。
①  d
②  d+1
③  (d+1)/m
④  (d+1)%m
【单选题】 从具有n个结点的二叉排序树中查找一个元素时,在平均情况下的时间复杂度大致为( )。
①  O(n)
②  O(1)
③  O(log2(n))
④  O(n的平方)
【单选题】 在对n个元素进行堆排序的过程中,空间复杂度为( )。
①  O(1)
②  O(log2(n))
③  O(n的平方)
④  O(nlog2(n))
【单选题】 假定对元素序列(7, 3, 5, 9, 1, 12, 8, 15)进行快速排序,则进行第一次划分后,得到的左区间中元素的个数为( )。
①  2
②  3
③  4
④  5
【单选题】 非线性结构是数据元素之间存在一种( )。
①  一对多关系
②  多对多关系
③  多对一关系
④  一对一关系