【单选题】【消耗次数:1】
The idea of winning the eyes of the people around ____ powerfully to some youngsters, so they are eagerly identifying themselves.
defy
expel
attract
appeals
参考答案:
复制
纠错
相关题目
【单选题】 When the idea of winning in sports is carried to excess, ____ competition can turn into disorder and violence.
①  honestly
②  honest
③  honorable
④  honorary
【单选题】 Casino hotels are built for one purpose: to attract people who will engage in ( ).
①  travelling
②  gambling
③  pleasure
④  relaxing
【单选题】 It s surprising that this idea took so long to _______.
①  add to
②  dispose of
③  catch on
④  absorb in
【单选题】 The program was so exciting that the children kept their eyes________on the screen.
①  to fix
②  to be fixed
③  fixed
④  fixing
【单选题】 35.No matter how frequently _____ the works of Beethoven always attract a large number of people.
①  performing
②  performed
③  tobeperformed
④  beingperformed
【单选题】 15.The program was so exciting that the children kept their eyes ____on the screen.
①  to fix
②  to be fixed
③  fixed
④  fixing
【单选题】 People walk around ( ) nineteenth-century clothes.
①  wearing
②  wore
③  wear
④  worn
【单选题】 it has been revealed that some government leaders _____ their authority and position to getillegal profits for themselves.
①  employ
②  take
③  abuse
④  overlook
【单选题】 In English some surnames ____ occupations or people. ?
①  deserve ?
②  desire ?
③  design ?
④  describe?
【单选题】 5.Sometimes animals can _______ the coming disaster, so they can protect themselves.
①  imagine
②  taste
③  sense
④  ignore
随机题目
【单选题】 设有一组初始记录关键字序列为(34,76,45,18,26,54,92),则由这组记录关键字生成的二叉排序树的深度为()。
①  4
②  5
③  6
④  7
【单选题】 单链表的存储密度
①  大于1
②  等于1
③  小于1
④  不能确定
【单选题】 设某棵二叉树的高度为10,则该二叉树上叶子结点最多有()。
①  20
②  256
③  512
④  1024
【单选题】 二路归并排序的时间复杂度为()。
①  O(n)
②  O(n2)
③  O(nlog2n)
④  O(1og2n)
【单选题】 下列排序算法中时间复杂度不受数据初始状态影响,恒为O(n2)的是
①  堆排序
②  冒泡排序
③  直接选择排序
④  快速排序
【单选题】 下列广义表是线性表的有
①  E=(a,(b,c))
②  E=(a,E)
③  E=(a,b)
④  E=(a,L);L=()
【单选题】 设某有向图的邻接表中有n个表头结点和m个表结点,则该图中有()条有向边。
①  n
②  n-1
③  m
④  m-1
【单选题】 若有18个元素的有序表存放在一维数组A[19]中,第一个元素放A[1]中,现进行二分查找,则查找A[3]的比较序列的下标依次为()
①  1,2,3
②  9,5,2,3
③  9,5,3
④  9,4,2,3
【单选题】 设一组权值集合W=(15,3,14,2,6,9,16,17),要求根据这些权值集合构造一棵哈夫曼树,则这棵哈夫曼树的带权路径长度为()。
①  129
②  219
③  189
④  229
【单选题】 设无向图G中的边的集合E={(a,b),(a,e),(a,c),(b,e),(e,d),(d,f),(f,c)},则从顶点a出发进行深度优先遍历可以得到的一种顶点序列为()。
①  aedfcb
②  acfebd
③  aebcfd
④  aedfbc