【判断题】【消耗次数:1】
In the Twenties the young people could enjoy alcohol legally.
正确
错误
参考答案:
复制
纠错
相关题目
【单选题】 Which of the following did the Sad Young Men enjoy?
①  the Babbitts
②  Victorian gentility
③  Bohemianism and eccentricity
④  The hypocritical do-goodism of Prohibition
【单选题】 The young people are _____ of their responsibility toward society.
①  consistent
②  conscious
③  sensitive
④  sensual
【判断题】 答题说明:句子没有语法错误请选择“正确”,有语法错误请选择“错误”Automobiles were too expensive that only rich people could afford them.
①  正确
②  错误
【单选题】 Young people ______ 62% of University teaching staff.
①  comprise
②  compose
③  contain
【单选题】 Young people in China now_______to travel often.
①  drive
②  drives
③  drove
【单选题】 At the bus stop _____ a soldier and two young people on their way to North Carolina.
①  were
②  was
③  is
④  waiting
【判断题】 Given that they are fresh from the university, the young people have done a good job.
①  正确
②  错误
【单选题】 The time will surely come ____ ordinary people could operate computers as well.
①  when
②  till
③  while
④  as
【单选题】 All people, [] they are old or young, have been trying their best to help those in need.
①  even if
②  whether
③  no matter
④  however
【判断题】 After the young people returned home, they developed a sudden bewildering world-weariness their relatives understood.
①  正确
②  错误
随机题目
【单选题】 设无向图G中有n个顶点,则该无向图的最小生成树上有()条边。
①  n
②  n-1
③  2n
④  2n-1
【单选题】 设某链表中最常用的操作是在链表的尾部插入或删除元素,则选用下列()存储方式最节省运算时间。
①  单向链表
②  单向循环链表
③  双向链表
④  双向循环链表
【单选题】 设某二叉树中度数为0的结点数为N0,度数为1的结点数为Nl,度数为2的结点数为N2,则下列等式成立的是()。
①  N0=N1+1
②  N0=Nl+N2
③  N0=N2+1
④  N0=2N1+l
【单选题】 设某无向图中有n个顶点e条边,则该无向图中所有顶点的入度之和为()。
①  n
②  e
③  2n
④  2e
【单选题】 设一棵m叉树中度数为0的结点数为N0,度数为1的结点数为Nl,……,度数为m的结点数为Nm,则N0=()。
①  Nl+N2+……+Nm
②  l+N2+2N3+3N4+……+(m-1)Nm
③  N2+2N3+3N4+……+(m-1)Nm
④  2Nl+3N2+……+(m+1)Nm
【单选题】 一个非空广义表的表头
①  一定是子表
②  一定是原子
③  不能是子表
④  可以是原子,也可以是子表
【单选题】 下列说法中错误的是
①  串是一种特殊的线性表
②  串中不能没有字符
③  串中可以有字母
④  串长大于或等于0
【单选题】 设一个栈的输入序列为A,B,C,D,则借助一个栈所得到的输出序列不可能是()。
①  A,B,C,D
②  A,C,D,B
③  D,C,B,A
④  D,A,B,C
【单选题】 把长度为m的单链表接在长度为n的单链表之后的算法的时间复杂度为
①  O(m)
②  O(n)
③  O(m+n)
④  O(1)
【单选题】 6,则通过栈的作用后可以得到的输出序列为()。
①  5,3,4,6,1,2
②  3,2,5,6,4,1
③  3,1,2,5,4,6
④  1,5,4,6,2,3