设数组data[0…m]作为循环队列sq的存储空间,front为队头指针,rear为队尾指针,则执行出队操作的语
A.sq↑.front:=sq↑.front+1;
B.sq↑.front:=(sq↑.front+1)%maxsize;
C.sq↑.rear:=(sq↑.rear+1)%maxsize;
D.sq↑.front:=(sq↑.front+1)%(maxsize+1);
A.sq↑.front:=sq↑.front+1;
B.sq↑.front:=(sq↑.front+1)%maxsize;
C.sq↑.rear:=(sq↑.rear+1)%maxsize;
D.sq↑.front:=(sq↑.front+1)%(maxsize+1);
A.sq↑.front:=sq↑.front+1;
B.Sq↑.front:=(Sq↑.front+1)%maxsize;
C.sq↑.rear:=(sq↑.rear+1)%maxsize;
D.sq↑.front:=(sq↑.front+1)%(maxsize+1) ;
A.front=(front+1)%(m+1)
B.front=(front+1)%m
C.rear=(rear+1)%m
D.front=front+1
A.front=front+1
B.front=(front+1)%(m-1)
C.front=(front-1)%m
D.front=(front+1)%m
A.qu.rear++
B.qu.rear=(qu.rear+1)%N
C.qu.front++;
D.qu.front=(qu.front+1)%N
A.rear-length
B.(rear-length+m)mod m
C.(1+rear+m-length)mod m
D.m-length
设顺序队列的类型为
typedefstruct
{
ElemTypedata[MaxSisel];
intfront,rear;
}Squeue;
Squeue*sq;
sq为指向顺序队列的指针变量,要进行新元素x的入队操作,按教课书约定,可用语句sq->data[sq->rear]=x;和()。
A.(rear-front+m) mod m
B.(rear-front+m+1) mod m
C.(rear-front+m-1) mod m
D.(rear-front-m-1) mod m
A.rear-length
B.(rear-length+m)mod m
C.(1+rear+m-length)mod m
D.m-length
A、q.rear-q.front
B、q.rear-q.front+1
C、(q.rear-q.front)%maxSize+1
D、(q.rear-q.front+maxSize)%maxSize