【单选题】【消耗次数:1】
He said that those books ?[填空] his.
was
is
were
are
参考答案:
复制
纠错
相关题目
【单选题】 Those gifts o rare books that were given t us were deeply _____.
①  appreciated
②  approved
③  appealed
④  applied
【单选题】 He said that his sister ?[填空]been there one week before
①  had
②  has
③  have
④  will have
【单选题】 He said that it ?[填空]nine then.
①  was
②  is
③  were
④  are
【单选题】 He said that he ?[填空] not seen her that day .
①  has
②  have
③  having
④  had
【单选题】 5.Nobody would believe his words though he said he was ______ of the crime.
①  pure
②  clear
③  innocent
④  guilty
【单选题】 Little ___ that we were watching his every move, so he seemed to be going his own way in this business.
①  he realized
②  ?he didn’t realize
③  ?didn’t he realize
④  ?did he realize
【单选题】 He said the sun [填空] in the east and [填空] in the west.
①  rose,set
②  rises,sets
③  rises,set
④  rise,sets
【单选题】 He was sick, [填空]they were quiet.
①  so
②  or
③  never
④  so that
【单选题】 He is the only one of those workers who [填空]able to do this job.
①  are
②  have
③  is
④  has
【单选题】 It was said that his father _________ .
①  has died
②  died
③  has been dead
④  had died
随机题目
【单选题】 在一个具有n个顶点和e条边的无向图的邻接矩阵中,表示边存在的元素(又称为有效元素)的个数为( )。
①  n
②  n*e
③  e
④  2e
【单选题】 用顺序存储的方法将完全二叉树中的所有结点逐层存放在数组中R[1..n],结点R[i]若有左孩子,其左孩子的编号为结点( )。
①  R[2i+1]
②  R[2i]
③  R[i/2]
④  R[2i-1]
【单选题】 在一棵度为3的树中,度为3的结点数为2个,度为2的结点数为1个,度为1的结点数为2个,则度为0的结点数为( )个。
①  4
②  5
③  6
④  7
【单选题】 在一个链队列中,front和rear分别为头指针和尾指针,则插入一个结点s的操作为( )。
①  front=front->next
②  s->next=rear;rear=s
③  rear->next=s;rear=s;
④  s->next=front;front=s;
【单选题】 在具有n个单元的顺序存储的循环队列中,假定front和rear分别为队头指针和队尾指针,则判断队空的条件为( )。
①  rear%n= = front
②  front+l= rear
③  rear= = front
④  (rear+l)%n= front
【判断题】 队是一种插入与删除操作分别在表的两端进行的线性表,是一种先进后出型结构。
①  正确
②  错误
【判断题】 在表结构中最常用的是线性表,栈和队列不太常用。
①  正确
②  错误
【判断题】 栈是一种对所有插入、删除操作限于在表的一端进行的线性表,是一种后进先出型结构。
①  正确
②  错误
【判断题】 栈和队列是一种非线性数据结构。
①  正确
②  错误
【判断题】 栈和链表是两种不同的数据结构。
①  正确
②  错误