【单选题】【消耗次数:1】
5.It is not how much you read but what you read that really _________.
counts
loses
argues
widens
参考答案:
复制
纠错
相关题目
【单选题】 Put it down, Richard. You mustnt read ____ letter.
①  anyones elses
②  anyones else
③  anyone elses
④  anyone else
【单选题】 It is only when you nearly lose someone ____ fully conscious of how much you value him.
①  do you become
②  then you become
③  that you become
④  have you become
【单选题】 I thought you________like something to read,so I have bought you some books.
①  may
②  might
③  could
④  must
【单选题】 11. I thought you _____ like something to read, so I have bought you some books.
①  may
②  might
③  could
④  must
【判断题】 阅读课文II.How to Improve Memory,判读正误5.It is easy to memorize something you dont understand.
①  正确
②  错误
【单选题】 “Are you ready for your paper?” “Not yet. I need___ to read through it.”
①  other three minutes
②  another three minutes
③  three other minutes
④  more three minutes
【单选题】 Read the book carefully __________ you’ll find lots of information related to our research.
①  if
②  and
③  so
④  or
【单选题】 He has left his book here on___, so that you can read it.
①  purpose
②  intention
③  aim
④  meaning
【判断题】 A: May I read the magazines on the table while waiting? B: Yes, you can.
①  正确
②  错误
【单选题】 How much do you ______for this package tour? Can I get a discount?
①  charge
②  change
③  choose
④  chase
随机题目
【判断题】 线索二叉树是一种逻辑结构。
①  正确
②  错误
【单选题】 若一个图的边集为{,,,,,},则从顶点1开始对该图进行广度优先搜索,得到的顶点序列可能为( )。
①  1,2,3,4,5
②  1,2,4,3,5
③  1,2,4,5,3
④  1,4,2,5,3
【单选题】 线索二叉树是一种( )结构。
①  逻辑
②  逻辑和存储
③  物理
④  线性
【单选题】 在一个具有n个顶点的有向图中,若所有顶点的出度数之和为s,则所有顶点的度数之和为( )。
①  s
②  s-1
③  s+1
④  2s
【判断题】 由二叉树的先序序列和后序序列可以唯一确定一颗二叉树。
①  正确
②  错误
【判断题】 二叉树的前序遍历中,任意结点均处在其子女结点之前。
①  正确
②  错误
【单选题】 设n , m 为一棵二叉树上的两个结点,在中序遍历序列中n在m前的条件是( )。
①  n在m右方
②  n在m 左方
③  n是m的祖先
④  n是m的子孙
【单选题】 在一个无向图中,若两顶点之间的路径长度为k,则该路径上的顶点数为( )。
①  k
②  k+1
③  k+2
④  2k
【单选题】 在一个具有n个顶点和e条边的有向图的邻接表中,保存顶点单链表的表头指针向量的大小至少为( )。
①  n
②  2n
③  e
④  2e
【单选题】 对于一个有向图,若一个顶点的度为k1,出度为k2,则对应逆邻接表中该顶点单链表中的边结点数为( )。
①  k1
②  k2
③  k1-k2
④  k1+k2