Are you free on Thursday? —That’s a good idea。() 此题为判断题(对，错)。
Are you free on Thursday? —That’s a good idea。()
此题为判断题(对，错)。
相关考题：
–What day is tomorrow? –Today is Tuesday. So it’s________. (A) Monday(B) Wednesday(C) Thursday(D) Saturday
You’d better prepare _____ tires if you decide to drive to New York.A、extraB、additionalC、spareD、free
以下能将字符串“good!”正确地存放在字符数组s中，或使指针；能指向这个字符串的是(33)。A．char s[4]={'g','o','o','d','!')B．char s[5]；s="good!";C．int s[5]="good!";D．char *s;s="good!:；
能正确进行字符串赋值、赋初值的语句组是()。 A、chars[5]={a,e,i,o,u};B、char*s;s=“good!“;C、chars[5]=“good!“;D、chars[5]=“good!“;
设rear是指向非空带头结点的循环单链表的尾指针，则删除起始结点的操作可表示为( )A．s=rear;B．rear=rear—＞next; rear=rear—＞next; free(rear); free(s);C．rear=rear—＞next—＞next;D．s=rear—＞next—＞next; free(rear); rear—＞next—＞next=s—＞next; free(s);
以下能正确进行字符串赋值、赋初值的语句是______。A．char s[5]：{'a'，'e'，'i'，'o'，'u'}；B．char *s； s="good"；C．char s[5]="good"；D．char s[5]； s="good"；
若不带头结点的链栈其栈顶指针为top，则删除栈顶元素，应进行如下（）操作。A．top=top-＞next; s=top; free(s);B．s=top; top=top-＞next; free(s);C．s=top-＞next; top-＞next=s-＞next;free(s);D．s=top; top-＞next=s-＞next;free(s);
设单循环链表中结点的结构为（data, next），且rear是指向非空的带头结点的单循环链表的尾结点的指针。若想删除链表的首元结点，则应执行的操作是（）。A．s = rear; rear = rear-＞next; free(s);B．s = rear-＞next; rear-＞next = s-＞next; free(s);C．s = rear-＞next-＞next; rear = rear-＞next-＞next; free(s);D．s = rear-＞next-＞next; rear-＞next-＞next = s-＞next; free(s);
在一个单链表中，若删除s所指结点的直接后继结点，则执行（)。A．p=s-＞next; s-＞next=p-＞next; free(p);B．p=s-＞next; free(p); s-＞next=s-＞next-＞next;C．s-＞next=s-＞next-＞next; free(s);D．s-＞next=s-＞next-＞next; p=s-＞next; free(p);