【单选题】【消耗次数:1】
It has been proposed that we _____our decision until the next meeting.
delayed
delay
can delay
are to delay
参考答案:
复制
纠错
相关题目
【单选题】 It has been proposed that we ____ our decision until the next meeting.
①  delayed
②  delay
③  can delay
④  are to delay
【单选题】 A: I must apologize to you for the delay. B: [填空].
①  Thats all right
②  No trouble at all
③  All the best
④  You are welcome
【判断题】 A: I must apologize to you for the delay. B: You are welcome.
①  正确
②  错误
【单选题】 4.After a delay of two hours, it was finally announced that the passengers could now _______ the plane.
①  get for
②  get up
③  go to
④  board
【单选题】 Now that we’ve ____, can we come to a decision?
①  thought over
②  thought of
③  thought through
④  thought about
【单选题】 As we can no longer wait for the delivery of our order, we have to ____ it.
①  postpone
②  refuse
③  delay
④  cancel
【单选题】 A: I thought you were working until 6:30. B: [填空], but we finished our meeting at 5:30 and were let go.
①  I tried to
②  I hoped so
③  Id love to
④  I was supposed to
【单选题】 This technology has been ?around for a long time, but not until recent years _______ it in marketing.
①  businesses employed
②  did businesses employ
③  businesses had employed?
④  had businesses employed
【单选题】 We all thought ______ pity that you were unable to attend our meeting.
①  that
②  which
③  this
④  it
【单选题】 The question came up at the meeting ___ we had enough money for our research.
①  that
②  which
③  whether
④  if
随机题目
【单选题】 计算机算法必须具备输入、输出和( )等5个特性。
①  可行性、可移植性和可扩充性
②  可行性、确定性和有穷性
③  确定性、有穷性和稳定性
④  易读性、稳定性和安全性
【单选题】 对于长度为18的顺序存储的有序表,若采用折半查找,则查找第15个元素的比较次数为( )。
①  3
②  4
③  5
④  6
【单选题】 对于长度为9的顺序存储的有序表,若采用折半查找,在等概率情况下的平均查找长度为( )的9分之一。
①  20
②  18
③  25
④  22
【单选题】 若要对1000个元素排序,要求既快又稳定,则最好采用( )方法。
①  直接插入排序
②  归并排序
③  堆排序
④  快速排序
【单选题】 若查找每个元素的概率相等,则在长度为n的顺序表上查找任一元素的平均查找长度为( )。
①  n
②  n+1
③  (n-1)/2
④  (n+1)/2
【单选题】 数据在计算机内有链式和顺序两种存储方式,在存储空间使用的灵活性上,链式存储比顺序存储要( )。
① 
② 
③  相同
④  不好说
【单选题】 在对n个元素进行快速排序的过程中,最坏情况下的时间复杂度为( )。
①  O(1)
②  O(log2(n))
③  O(n的平方)
④  O(nlog2(n))
【单选题】 若对n个元素进行直接插入排序,在进行第i趟排序时,假定元素r[i+1]的插入位置为r[j],则需要移动元素的次数为( )。
①  j-i
②  i-j-1
③  i-j
④  i-j+1
【单选题】 若要从1000个元素中得到10个最小值元素,最好采用( )方法。
①  直接插入排序
②  简单选择排序
③  堆排序
④  快速排序
【单选题】 非线性结构是数据元素之间存在一种:( )。
①  一对多关系
②  多对多关系
③  多对一关系
④  一对一关系