Заполнения очереди

program prog;
 
type
  pItem = ^Item;
  Item = record
    data: real;
    next: pItem;
  end;
 
  Queue = record
    head: pItem;
    tail: pItem;
  end;
 
{-----------------}
 
procedure pushQ(var q: Queue; data: real);
var
  newItem: pItem;
begin
  if q.tail = nil then begin
    New(q.tail);
    q.head:= q.tail;
    q.tail^.data:= data;
    q.tail^.next:= nil;
  end
  else begin
    New(newItem);
    newItem^.data:= data;
    newItem^.next:= nil;
    q.tail^.next:= newItem;
    q.tail:= newItem;
  end;
end;
 
{-----------------}
 
procedure popQ(var q: Queue);
var
  p: pItem;
begin
  p:= q.head;
  q.head:= q.head^.next;
  Dispose(p);
end;
 
{-----------------}
 
procedure printQ(q: Queue);
var
  p: pItem;
begin
  p:= q.head;
  while p <> nil do begin
    Write(p^.data:5:1);
    p:= p^.next;
  end;
end;
 
{-----------------}
 
var
  i: integer;
  q: Queue;
begin
  randomize;
  q.tail:= nil;
 
  for i:= 1 to 10 do begin
    pushQ(q, random * (0.8 - 0.3) + 0.3);
    printQ(q);
    WriteLn;
  end;
 
  WriteLn;
 
  while q.head <> nil do begin
    printQ(q);
    popQ(q);
    WriteLn;
  end;
 
  ReadLn;
end.

const
  N = 6;
  a: array[1..N] of real = (0.3, 0.4, 0.5, 0.6, 0.7, 0.8);
...
  pushQ(q, a[random(N)+1]);