He said, “I ________ a lot of new words by the end of last year.” A.had already learntB.have already learntC.would have already learntD.already learnt
He said, “I ________ a lot of new words by the end of last year.”
A.had already learnt
B.have already learnt
C.would have already learnt
D.already learnt
相关考题：
A neighbor _________ me about him. He_________ Percy Buttons was a beggar.() A.said, spokeB.told, saidC.said, talkedD.told, spoke
to, I, how, last, winter, skate, learned__________________________________________________________________________.
Which traversal method for a binary tree does the following Pascal code illustrate? Procedure traverse(p：pointer)； Begin IfpNIL Then begin Traverse (p^．left)； Process(p)； Traverse(p^．right) End； End_A．pre_orderB．middle_orderC．noneD．last_order
template int SeqList::Insert(Type else {Last++;for(int j=last;jdata[i]=x;return 1;}}对于结点类型为SeqList的顺序表，以上算法的功能为：()
阅读FORTAN程序：OPEN(8，FILE=FILE2.DAT，STATUS:NEW)DO10I=1>3WRITE(8，(4I4))(J+I，J=1，4)10CONTINUECLOSEC8)END程序运行后，数据文件FIFE2.DAT的内容是：
阅读FORTRAN程序：OPEN(8，FILE=FILE2 DAT,STATUS=NEW)DO 10 I=1，3WEITE(8，(4I4)JI+I,J=1，4)10 CONTINUECLOSE(8)END程序运行后，数据文件FILE2，DAT的内容是：
2、在顺序结构表示的线性表中，删除第i个元素（数组下标为i-1)，需要把后面的所有元素都往前挪一位，相应的语句是： for （___________ ) PtrL-＞Data[j-1]=PtrL-＞Data[j]; 其中空缺部分的内容应该是A．j = i; j＜ = PtrL-＞Last; j++B．j =PtrL-＞Last; j＞= i; j--C．j = i-1; j＜ = PtrL-＞Last; j++D．j =PtrL-＞Last; j＞= i-1; j--
在顺序结构表示的线性表中，删除第i个元素（数组下标为i-1)，需要把后面的所有元素都往前挪一位，相应的语句是： for （___________ ) PtrL-＞Data[j-1]=PtrL-＞Data[j]; 其中空缺部分的内容应该是A．j = i; j＜ = PtrL-＞Last; j++B．j =PtrL-＞Last; j＞= i; j--C．j = i-1; j＜ = PtrL-＞Last; j++D．j =PtrL-＞Last; j＞= i-1; j--