2
: .
: .
,
, , .
. . .
, , . . .
: . :
:= +1 =1,2
, . 쳿 . , . : - , , j , .
Pascal. , , , , , , .
:
Procedure read_from_queue;
Begin
If j<=0 then writeln('Queue is empty')
Else
Begin
Writeln(a[1]);
for k:=1 to j-1 do
a[k]:=a[k+1];
a[j]:=0;
dec(j);
end;
End;
:
Procedure write_from_queue;
Begin
If j=n then writeln('Queue is full')
Else
Begin
Inc(j);
Readln(a[j]);
End;
End;
:
Procedure print_quele;
Var k:word;
If j>0 then
for k:=1 to j do
write(a[j],' ')
else write('Queue is empty');
End;
. , , ⳻ . ij , . , .
ճ
1. . ³ quele_( (.)).
|
|
|
2. - :
1)
2) ;
3) ;
4)
5) .
. .
3. n=6 10 :
Ø - ;
Ø ;
Ø ;
Ø ;
Ø .
Ø ;
Ø ;
Ø .
.
4. .
5. .
uses cRT;
const n=6;
var ch:char;
i,j:word;
a:array[1..20] of integer;
Procedure read_from_queue;
Begin
End;
Procedure write_from_queue;
Begin
End;
Procedure print_quele;
Var k:word;
Begin
End;
procedure print_mas;
var k:word;
Begin
for k:=1 to n do write(a[k], ' ');
end;
{-----------Golovna programa--------}
Begin
clrscr;
ch:='0';i:=0; j:=0;
While ch<>'5' do
Begin
writeln('1. Zapus elementa y queue');
writeln('2. Prohutatu element z queue');
writeln('3. Pokazatu vmist queue');
writeln('4. Pokazatu vmist masuvy');
writeln('5. zaverchutu poboty si queue');
writeln;
write('Vvedite N menu - '); readln(ch);
Case ch of
'1':write_from_queue;
'2':begin read_from_queue;; writeln('ENTER');readln(ch); end;
'3':begin print_quele;;writeln('ENTER');readln(ch); end;
'4':begin print_mas;writeln('ENTER');readln(ch) end;
'5': exit;
end;
end;
End.
1. ?
2. ?
3. ?
4. ?
5. ? .
6. ? .
7. 
.
8. .
9. ? .
