---When are you going on holiday? ---_______.A、Only one-week holidayB、Next week.C、They h

题目

---When are you going on holiday? ---_______.

A、Only one-week holiday

B、Next week.

C、They haven’t decided where to go

D、With my wife.

如果没有搜索结果或未解决您的问题,请直接 联系老师 获取答案。
相似问题和答案

第1题:

Certkiller .com has asked you to create a file management application to monitor the hosts file.Certkiller .com has instructed you to change the hosts file if it has been changed.You, therefore, need to display the size and whether the hosts file is set to read-only.What should you do?()

A.

B.

C.

D.


参考答案:A

第2题:

已知h是指向单向加头链表的首指针,删除表头结点的操作是_____。

A.p=h,h=p->next;free(p);

B.p=h->next;free(p);h=h->next;

C.p=h->next,h->next=p->next;free(p);

D.free(h->next);h=h->next;


head->next= =NULL

第3题:

It was _____ he came bank from Africa that wear _________ he met the girl he would like to marry.

A. when; then

B. not; until

C. not until; that

D. only; when


正确答案:C

第4题:

已知h是指向单向加头链表的首指针,删除表头结点的操作是_____。

A.p=h->next;free(p);h=h->next;

B.free(h->next);h=h->next;

C.p=h,h=p->next;free(p);

D.p=h->next,h->next=p->next;free(p);


head->next= =NULL

第5题:

已知h是指向单向加头链表的头指针,p指向一个新结点,将p所指结点插在表头的操作是_____。

A.p->next=h,h->next=p;

B.p->next=h->next,h->next=p;

C.p->next=h,h=p;

D.h->next=p,p->next=h->next;


p->next=h->next,h->next=p;

第6题:

Why do you want a new job ______you've got such a good one already?

A. that

B. where

C. which

D. when


正确答案:D

17.答案为D。为什么你已经有个好工作,还要找新工作?分析整句结构,从句做状语,只有 D为正确选项。

第7题:

已知h是指向单向加头链表的头指针,删除首元结点的操作是_____。

A.p=h,h=p->next;free(p);

B.p=h->next;free(p);h=h->next;

C.p=h->next,h->next=p->next;free(p);

D.free(h->next);h=h->next;


p=h->next,h->next=p->next;free(p);

第8题:

You’d better()to hospital at once.

A. go

B. to

C. going


参考答案:A

第9题:

已知h是指向单向加头链表的首指针,p指向一个新结点,将p所指结点插在表头的操作是_____。

A.p->next=h,h->next=p;

B.p->next=h->next,h->next=p;

C.p->next=h,h=p;

D.h->next=p,p->next=h->next;


head->next= =NULL

第10题:

对于一个头指针为h的链栈(带头结点),正确的出栈操作是()。

A.h=h->next;

B.h->next=h->next->next;

C.h=h->next->next;

D.h->next=h;


h->next=h->next->next;