【单选题】【消耗次数:1】
That man alone over there – who is he?
He is a student
He is Doctor Took
A driver, I suppose
He’s drunk
参考答案:
复制
纠错
相关题目
【判断题】 A: Who is the boy? B: He is a student.
①  正确
②  错误
【单选题】 He is a doctor of().
①  phase
②  phone
③  philosophy
④  teacher
【单选题】 2. ______ he ______ I am a doctor.
①  Both; and
②  Either; nor
③  Neither; nor
④  Neither; and
【单选题】 The young man struggled to _______ where he was at the time the murder took place.
①  reduce
②  respond
③  respond
④  recall
【单选题】 The young man struggled to _______ where he was at the time the murder took place.
①  reflect
②  respond
③  resolve
④  recall
【单选题】 Is he still in the company? Who_______for?
①  was he waiting
②  is he waiting
③  does he wait
【简答题】 Who was the old man? And what was he doing when they saw him?
【单选题】 He is a man who always makes his promises [] who never keeps them.
①  or
②  and
③  but
④  so
【单选题】 I went to the doctor’s yesterday. I had to wait for half an hour before he ___ see me.
①  ?can
②  ?may
③  ?might
④  ?could
【单选题】 After the student was praised for what he had done, he said:“ I______ even better under harder conditions. ”
①  had done
②  did
③  would have done
④  would do
随机题目
【单选题】 任何一棵二叉树的叶结点在先序、中序和后序遍历序列中的相对次序( )。
①  A.不发生改变
②  B.发生改变
③  C.不能确定
④  D.以上都不对
【单选题】 树最适合于用来表示( )。
①  A.线性结构的数据
②  B.顺序结构的数据
③  C.元素之间无前驱和后继关系的数据
④  D.元素之间有包含和层次关系的数据
【单选题】 设某一二叉树先序遍历为abdec,中序遍历为dbeac,则该二叉树后序遍历的顺序是( )。
①  A.abdec
②  B.debac
③  C.debca
④  D.Abedc
【单选题】 如果将给定的一组数据作为叶子数值,所构造出的二叉树的带权路径长度最小,则该树称为( )。
①  A.哈夫曼树
②  B.平衡二叉树
③  C.二叉树
④  D.完全二叉树
【单选题】 在二叉树先序遍历中,任一个结点均在其子女结点前面,这种说法( )。
①  A.正确
②  B.不正确
③  C.无法判断
④  D.以上均不对
【单选题】 一棵有n个结点,采用链式存储的二叉树中,共有( )个指针域被有效使用(即指针域为非空)。
①  A.n+1
②  B.n
③  C.n-1
④  D.n-2
【单选题】 对( ) 进行中序遍历,可以使遍历所得到的序列是有序序列。
①  A.完全二叉树
②  B.二叉排序树
③  C.满二叉树排
④  D.哈夫曼树
【单选题】 一棵具有38个结点的完全二叉树,最后一层有( )个结点。
①  A.7
②  B.5
③  C.6
④  D.8
【单选题】 在一棵二叉树中,若编号为5的结点存在左孩子,则左孩子的顺序编号为( )。
①  A.9
②  B.10
③  C.11
④  D.12
【单选题】 在一个尾指针为rear的不带头结点的单循环链表中,插入一个s所指的结点,并作为第一个结点,可执行( ).
①  A.rear?next=s;s?next=rear?next
②  B.rear?next=s?next;
③  C.rear=s?next
④  D.s?next=rear?next ; rear?next=s;