sharmilag

 Profile Answers by sharmilag 

• Feb 8th, 2009

 

[F=front, R=rear, P= pointer, q[] is the array variable]
Algorithm:
     if F != R
       F = P
       count = 0
       while(P <= R)
       {
          count = count + 1;
          P = P+1;
        }
 //Display count which shows number of elements in queue.

piyushbeli

 Profile Answers by piyushbeli 

• Apr 13th, 2009

 

F Front

R Rear

q array of queue

p pointer to array

if(F=Null)

return 0;

 

count=1

while(p!=R)

{

count++;

p=p+1;

}

clickankit4u

 Profile Answers by clickankit4u 

• May 31st, 2009

 

Queue: array in which you insert at front and remove from rare.

Static Queue: queue which is of fix size and can not variate in size at runtime.

Optimized way to count the elements present.


F -> front
R -> rare
No -> no of elements present
Max_size -> max size of queue.

********************************************************************

if(F > R)
No = F - R;
else if( R > F)
No = ((Max_size - R) + F)
else
No = 0

********************************************************************

boyanamadhavilatha

 Profile Answers by boyanamadhavilatha 

• Sep 23rd, 2009

 

[F=front, R=rear, P= pointer, q[] is the array variable]
Algorithm:
     if F != R
       P= F
       count = 0
       while(P <= R)
       {
          count = count + 1;
          P = P+1;
        }
 //Display count which shows number of element

rupaliverma.iti

 Profile Answers by rupaliverma.iti 

• Feb 13th, 2010

 

[F front R rear P pointer q[] is the array variable] 
Algorithm: 
if (F != R)
P= F
count =0 
while(P <= R) 
{
count count + 1;
P P+1; 
}
//Display count which shows number of element