【单选题】【消耗次数:1】
It’s quite different from _____ I read last month.
that
which
the one
the one what
参考答案:
复制
纠错
相关题目
【单选题】 I haven’t read ____ of his books, but judging from the one I have read I think he’s a very promising writer.
①  any
②  none
③  both
④  either
【单选题】 By the end of last month, she ____ over five hundred letters of congratulation from different parts of the world.
①  would received
②  has received
③  had received
④  receive
【单选题】 By the end of last month, she _____ over five hundred letters of congratulation from different parts of the world.
①  would received
②  has received
③  had received
④  receive
【单选题】 The weather in Harbin is quite different from____ in Hainan.
①  the one
②  one
③  that
④  it
【单选题】 Apart from the meaning of broadening one’s horizon, to ( ) also means to be alert to and be aware of the potential danger of something.
①  keep an eye on
②  fix one’s eyes on
③  turn a blind eye to
④  open one’s eyes
【单选题】 25.I prefer this chair to the other one. It’s ___________ .
①  comfortable
②  more comfortable
【单选题】 What do think of the industrial park _______ we visited last month?
①  of which
②  which
③  where
【单选题】 Only when one is ______ of one’s getting behind is one more likely to catch up.
①  critical
②  aware
③  visual
④  effective
【单选题】 What do think of the industrial park [填空] we visited last month?
①  of which
②  which
③  where
【单选题】 Which one of the following drugs is AChE inhibitor ( )
①  PAM-Cl
②  nicotine
③  neostigmine
④  atropine
⑤  pilocarpine
随机题目
【判断题】 广义表的(( a,c) , a ,b , d , e ,( (I ,j ) ,k ) )表头是( a , c)。
①  正确
②  错误
【判断题】 从n个数中选取最大元素需要进行(n+1)次数据元素间的比较
①  正确
②  错误
【判断题】 设顺序队列的类型为typedef struct { ElemType data[MaxSise]; int front,rear;} Squeue; Squeue sq为指向顺序队列的指针变量,要进行元素的出队操作,并把元素赋给边量x, 按教课书约定,可用语句x=sq-data[sq-front];和sq-fronf++;。
①  正确
②  错误
【判断题】 把数据存储到计算机中,并具体体现数据之间的逻辑结构称为物理结构。
①  正确
②  错误
【判断题】 数据元素是性质相同的数据元素的集合,是数据的子集。
①  正确
②  错误
【判断题】 设顺序存储的线性表长度为n,要删除第i个元素,按课本的算法,当i=4时,移动元素的次数为3
①  正确
②  错误
【判断题】 设有一个带头结点的链队列,队列中每个结点由一个数据域data和指针域next组成,front和rear分别为链队列的头指针和尾指针。设p指向要入队的新结点(该结点已被赋值),则入队操作为rear-next=p; p = rear;
①  正确
②  错误
【判断题】 带头结点的单向链表为空的判断条件是head = =NUL(设头指针为head)。
①  正确
②  错误
【判断题】 设top是一个链栈的栈顶指针,栈中每个结点由一个数据域data和指针域next组成,设用x接收栈顶元素,则出栈操作为top=top-x=top-。
①  正确
②  错误
【单选题】 元素2,4,6,8按顺序依次进栈,按该栈的的可能输出序列依次入队列,该队列的可能输出序列是( )(进栈出栈可以交替进行)。
①  A.8,6,2,4
②  B.8,4,2,6
③  C.6,2,4,8
④  D.8,6,4,2