【单选题】你在海边散步,见到了你的朋友罗斯,你该如何为他介绍你的新朋友?
A.
Rose, let me introduce my friend to you.
B.
Rose,please let me help you meet my friend.
C.
Please do me a favor,Rose.
【简答题】简述下述算法的功能 Linklist mynote(Linklist L) //L 是不带头结点的单链表的头指针 { if(L&&L->next) { q=L; L=L->next; p=L; while(p->next) p=p->next; p->next=q; q->next=NULL; } return L; }
【判断题】硬盘盘腔洁净度要求很高,所以用户需要定期打开硬盘盘盖,对磁盘盘片、等部件进行彻底的清理,以保障硬盘数据安全。
【简答题】Suppose Robert Smith, a classmate of yours, is going to visit you during the week-long holiday.Write a letter to him and tell him the arrangements you have made for him during the holiday. You should ...
【单选题】对以下链表执行如下程序段,说明执行结果中,各个结点数据域分别是()void pur_LinkList(LinkList H){ PNode p, q, r ,s; p=H->link; if(p==NULL ) return; while (p->link) { s=p; q=p->link; while (q) { if (q->info==p->info) { s->link=q->l...
【单选题】对以下单链表执行如下程序段,说明执行结果中,各个结点的数据域分别是()void fun (Linklist H) //H是带有头结点的单链表{ PNode p,q; p=H->link; H->link=NULL; while (p) { q=p; p=p->link; q->link=H->link; H->link=q; }}【图片】
【简答题】Wang Bing is (write) an E-mail to his friend.
【单选题】对以下链表执行如下程序段,说明执行结果中,各个结点数据域分别是()void pur_LinkList(LinkList H){ PNode p, q, r ,s; p=H->link; if(p==NULL ) return; while (p->link) { s=p; q=p->link; while (q) { if (q->info==p->info) { s->link=q->l...
C.
10 , 20 , 20 , 10 , 10
【单选题】(5分) 8051单片机定时/计数器有几种工作方式