【单选题】【消耗次数:1】
A: Excuse me, [填空]? B: Certainly, Walk three blocks along this street, and then turn left. Walk another block, and youll find the cinema across the street. You cant miss it.
but will you please tell me where you live
but can you help me with the bag
but would you tell me how to find the cinema
but can you tell me the way to the cinema
参考答案:
复制
纠错
相关题目
【单选题】 A: Excuse me. Can you tell me how to get to the tube?B: Turn right around the corner and then walk one block up. [填空].
①  You cant miss it
②  Just do that
③  Try that way
④  Sure thing,miss
【单选题】 Excuse me, but can you tell me the way to the airport?
①  Don’t ask that
②  Sorry, I’m a stranger here
③  No, I can’t say that
④  No, you’re driving too fast
【单选题】 Would you like [填空] the cinema with me?
①  go to
②  to go to
③  to going
④  going to
【单选题】 A: Can you give me a hand? B: [填空].
①  I can give you both hands
②  Im all yours
③  The pleasure is mine
④  Ill watch your back
【判断题】 A: Why didnt you tell me you had a girlfriend? B: Its none of your business.
①  正确
②  错误
【单选题】 A: Are you following me? B: [填空]
①  Can you walk slowly, please?
②  Let me think of it.
③  Im afraid not.
④  Who knows?
【判断题】 A: Can you do this for me, please? B: No, thanks.
①  正确
②  错误
【单选题】 Woman: Bob, do you think you can lend me fifty dollars? Bob: Let me see. ____
①  You know I have no money at all.
②  Sorry, I don’t think I have much with me.
③  I don’t think you should do it.
④  Oh, I have quite a lot.
【判断题】 A: Would you please help me with my lessons? B: With pleasure.
①  正确
②  错误
【单选题】 A: Would you mind changing seats with me? B: [填空].
①  Yes, you can
②  Of course, I dont mind
③  No, I dont mind
④  Certainly, please do.
随机题目
【单选题】 一个顺序栈S,其栈顶指针为top,则将元素e入栈的操作是( )。
①  *S->top=e;S->top++;
②  S->top++;*S->top=e;
③  *S->top=e
④  S->top=e;
【单选题】 一个队列的入队序列是1,2,3,4,则队列的出队序列是( )。
①  1,2,3,4
②  4,3,2,1
③  1,4,3,2
④  3,4,1,2
【单选题】 判断一个循环队列Q(最多n个元素)为满的条件是( )。
①  Q->rear==Q->front
②  Q->rear==Q->front+1
③  Q->front==(Q->rear+1)%n
④  Q->front==(Q->rear-1)%n
【单选题】 表达式a*(b+c)-d的后缀表达式是( )。
①  abcd+
②  -abc+*d
③  -abc*+d
④  --+*abcd
【单选题】 在一个具有n个单元的顺序栈中,假定以地址低端(即0单元)作为栈底,以top作为栈顶指针,当做出栈处理时,top变化为( )。
①  top不变
②  top=0
③  top-
④  -top++
【判断题】 单链表不是一种随机存储结构。
①  正确
②  错误
【判断题】 用循环单链表表示的链队列中,可以不设队头指针,仅在队尾设置队尾指针。
①  正确
②  错误
【判断题】 链表的删除算法很简单,因为当删除链中某个结点后,计算机会自动地将后续的各个单元向前移动。
①  正确
②  错误
【判断题】 线性表在物理存储空间中也一定是连续的。
①  正确
②  错误
【判断题】 在具有头结点的单链表中,头指针指向链表的第一个数据结点。
①  正确
②  错误