【单选题】【消耗次数：1】
20._____your poor record at school, we think you should study more.
①
In view of
②
For view of
③
From view of
④
Within view of
参考答案：
复制
纠错
相关题目
【单选题】
David watched her car until it ________ from view.
①
remainded
②
dalayed
③
grew
④
disappeared
【单选题】
4. David watched her car until it ____ from view.
①
remained
②
delayed
③
grew
④
disappeared
【单选题】
What does the functional view of language see language?
①
A system of categories based on the communicative needs of the learner
②
A communicative tool to build up and maintain social relations between people
③
A linguistic system made up of various subsystems
④
A a linguistic system and a means for doing things.
【单选题】
What does the structural view of language see language?
①
A system of categories based on the communicative needs of the learner
②
A communicative tool to build up and maintain social relations between people
③
A linguistic system made up of various subsystems
④
A linguistic system and a means for doing things.
【单选题】
What does the interactional view of language see language?
①
A system of categories based on the communicative needs of the learner
②
A communicative tool to build up and maintain social relations between people
③
A linguistic system made up of various subsystems
④
A linguistic system and a means for doing things.
【判断题】
In William Cullen Bryant’s poem “Thanatopsis”, the title means view of death.
①
正确
②
错误
【单选题】
The taxi driver _______ at me in the rear-view mirror when I got on the car.
①
smile
②
laughed
③
grinned
④
stared
随机题目
【判断题】
设有一个带头结点的链队列，队列中每个结点由一个数据域data和指针域next组成，front和rear分别为链队列的头指针和尾指针。设p指向要入队的新结点(该结点已被赋值)，则入队操作为rear-next=p; p = rear;
①
正确
②
错误
【单选题】
元素2，4，6，8按顺序依次进栈，按该栈的的可能输出序列依次入队列，该队列的可能输出序列是（ ）（进栈出栈可以交替进行）。
①
A．8，6，2，4
②
B．8，4，2，6
③
C．6，2，4，8
④
D．8，6，4，2
【单选题】
对不带头结点的单向链表,判断是否为空的条件是（ ）（设头指针为head）。
①
A．head==NULL
②
B．head-next= =NULL
③
C．head-next= =head
④
D．head =NULL
【单选题】
头指针为head的带头结点的单向链表为空的判定条件是( )为真。
①
A. head= =NULL
②
B. head-next= =NULL
③
C. head-next=NULL;
④
D. head-next!= NULL
【单选题】
在一个栈顶指针为top的链栈中，将一个p指针所指的结点入栈，应执行（ ）。
①
A.top-next=p;
②
B.p-next=top-top-next=p;
③
C.p-next=top; top=p;
④
D．p-next=top- top=top-
【单选题】
在一个不带头结点的链队中，假设f和r分别为队头和队尾指针，则对该队列进行出队操作中并把结点的值保存在变量e中,其运算为e=f?data；和（ ）。
①
A．r=r?next;
②
B．r?next=r;
③
C．f=f?next;
④
D．f?next=f;