【单选题】【消耗次数:1】
_____money, she is quite rich. However, this does not mean that she is happy.
Concerning
As to
In terms of
In the light of
参考答案:
复制
纠错
相关题目
【单选题】 ____ money, she is quite rich. However, this does not mean that she is happy.
①  Concerning
②  As to
③  In terms of
④  In the light of
【单选题】 16. _____ money, they are rich.
①  In terms of
②  About
③  Because of
④  By way of
【单选题】 9.She does not_____ that she owes the money, but she just wouldn’t like to return it.
①  argue
②  . dispute
③  think
④  agree
【单选题】 She is quite capable and can be depended on in an __________ .
①  affair
②  accident
③  incident
④  emergency
【判断题】 She doesn’t do her work on weekdays, does she?
①  正确
②  错误
【单选题】 She resorted to ____ when she had no money to buy foods for her children.
①  have stolen
②  steal
③  stole
④  stealing
【单选题】 She resorted to _____ when she had no money to buy foods for her children.
①  have stolen
②  steal
③  stole
④  stealing
【判断题】 She plays the piano better than she does the guiter.此句中的“does”替代了谓语动词“plays”
①  正确
②  错误
【判断题】 Does she do the exercise every day?
①  正确
②  错误
【单选题】 ____ she was invited to the hall made her very happy.
①  That
②  If
③  When
④  Because
随机题目
【单选题】 若有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
【单选题】 设指针q指向单链表中结点A,指针p指向单链表中结点A的后继结点B,指针s指向被插入的结点X,则在结点A和结点B插入结点X的操作序列为()。
①  s-next=p-next;p-next=-s
②  q-next=s;s-next=p
③  p-next=s-next;s-next=p
④  p-next=s;s-next=q
【单选题】 设二叉排序树上有n个结点,则在二叉排序树上查找结点的平均时间复杂度为()。
①  O(n)
②  O(n2)
③  O(nlog2n)
④  O(1og2n)
【单选题】 设有6个结点的无向图,该图至少应有()条边才能确保是一个连通图。
①  5
②  6
③  7
④  8
【单选题】 若线性表最常用的操作是存取第i个元素的值,则采用_______存储方式节省时间。
①  单链表
②  双链表
③  单循环链表
④  顺序表
【单选题】 设指针变量front表示链式队列的队头指针,指针变量rear表示链式队列的队尾指针,指针变量s指向将要入队列的结点X,则入队列的操作序列为()。
①  front-next=s;front=s;
②  s-next=rear;rear=s;
③  rear-next=s;rear=s;
④  s-next=front;front=s;
【单选题】 设s1=“”,则strlen(s1)的值是
①  0
②  1
③  2
④  3
【单选题】 在n个结点的顺序表中,算法的时间复杂度是O(1)的操作是
①  访问第i个结点(1≤i≤n)
②  在第i个结点后插入一个新结点(1≤i≤n)
③  删除第i个结点(1≤i≤n)
④  将n个结点从小到大排序