The bus ()with the truck on the highway last night. A、unitedB、undertookC、vanishedD、collided

The bus ()with the truck on the highway last night.

A、united

B、undertook

C、vanished

D、collided


相关考题:

40_____A. drivewayB. pathC. crossroadD. highway

阅读以下函数说明和C语言函数,将应填入(n)处的字句写在对应栏内。[说明]这是一个模拟渡口管理的算法。某汽车轮渡口,过江渡船每次能载10辆车过江。过江车辆分为客车类和火车类,上船有如下规定:同类车先到先上船,客车先于货车上渡船,且每上4辆客车,才允许上一辆货车;若等待客车不足4辆,则以货车代替,若无货车等待则允许客车都上船。程序中用到的函数有enqueue(queue*sq,elemtype*x)在队列sq中入队一个元素x;outqueue(queue*sq,elemtype*x)在队列sq中出队一个元素,并将其值赋给x;empty(queue*sq)判断队列sq是否为空队,若为空,返回1;否则返回0。[C程序]include<stdio.h>void pass(){queue bus,truct; /*bus表示客车队列,truck表示货车队列*/char ch;int n,tag; /* ]n为车号,tag为标志,tag=0表示客车,tag=1表示货车*/intcount=0,countbus=0,counttruck=0; /*分别表示上渡船汽车数、客车数、货车数*/while(1){printf("输入命令: \n");Scanf("%c",ch);switch(ch){case'e':case'E': printf("车号: \n");Scanf("%d",n);printf("客车\货车(0\1): \n");scanf("%d",tag);if( (1) )enqueue(bus,n);elseenqueue(truck,n);break;case'i':case'I': while(count<10){if( (2) empty(bus)==0){ /*客车出队*/outqueue(bus,n);printf("上船的车号为: \n");count++;(3) ;}eise if( (4) ){ /*货车出队*/countbus=0;outqueue(truck,n);printf("上船的车号为: \n");count++;counttruck++;}else if(empty(bus)==0){(5);outqueue(truck,n);printf("没有10辆车排队轮渡\n");count++;countbus++;}else{printf("没有10辆车排队轮渡\n");retUrn;}break;}case'q':case'Q':break;}if(ch=='q' || ch=='Q')break;}}

已知last指向单向简单链表的尾结点,将s所指结点加在表尾,不正确的操作是____。A.last->next=s,last=s,last->next=NULL;B.last->next=s,s->next=NULL,last=s;C.s->next=NULL, last->next=s, s=last;D.s->next=NULL, last->next=s,last=s;

30、关于以下代码,描述错误的是()。 lst = ["car","truck"] def fun(a): lst =[] lst.append(a) return fun("bus") print(lst)A.代码函数定义中,ls.append(a)中的ls是局部变量B.执行代码输出结果为['car', 'truck']C.lst.append(a) 代码中的ls是列表类型D.执行代码输出结果为['car', 'truck', 'bus']

7、已知last指向单向简单链表的尾结点,将s所指结点加在表尾,正确的操作是____。A.s->next=s,last=s,last->next=NULL;B.last->next=s,s->next=NULL,last=s;C.s->next=NULL, last->next=s, s=last;D.s->next=last, last->next=NULL,last=s;

已知last指向单向简单链表的尾结点,将s所指结点插入在表尾,正确的操作是____。A.s->next=s,last=s,last->next=NULL;B.last->next=s,s->next=NULL,last=s;C.s->next=NULL, last->next=s, s=last;D.s->next=last, last->next=NULL,last=s;

已知last指向单向简单链表的尾结点,将s所指结点加在表尾,正确的操作是____。A.s->next=s,last=s,last->next=NULL;B.last->next=s,s->next=NULL,last=s;C.s->next=NULL, last->next=s, s=last;D.s->next=last, last->next=NULL,last=s;

已知last指向单向简单链表的尾结点,将s所指结点加在表尾,不正确的操作是____。A.s->next=NULL, last->next=s,last=s;B.s->next=NULL, last->next=s, s=last;C.last->next=s,s->next=NULL,last=s;D.last->next=s,last=s,last->next=NULL;

以下程序运行后的输出结果是‪‪‪‪‪‫‪‪‪‪‪‫‪‪‪‪‪‫‪‪‪‪‪‫‪‪‪‪‪‪‫‪‪‪‪‪‫‪‪‪‪‪‫‪‪‪‪‪‫‪‪‪‪‪‫‪‪‪‪‪‪‫:() ls = ["car","truck"] def funC(a): ls.append(a) return funC("bus") print(ls)

以下程序运行后的输出结果是‪‪‪‪‪‫‪‪‪‪‪‫‪‪‪‪‪‫‪‪‪‪‪‫‪‪‪‪‪‪‫‪‪‪‪‪‫‪‪‪‪‪‫‪‪‪‪‪‫‪‪‪‪‪‫‪‪‪‪‪‪‫:() ls = ["car","truck"] def funC(a): ls =[] ls.append(a) return funC("bus") print(ls)