for data structure and algorithms

Question

3. Suppose you are given a data file called "f" and a queue called "Q". Each record in "f" has an "A" or "D" character. Write an algorithm that reads all the records in the file one by one. If the record keeps "A' adds this record to "Q". If the record keeps "D" delete an element from the "Q". File \-f" and "0" have the same type. Queue capacity is 20 records.

Answer 1

f = openFILE();

while not end-of-file(f)

reads the next record from the file

if not end-of-file(f)

if record contains A then

iReturn = Q.push(A);

if iReturn==FAILURE

output Queue Push FAILS - perhaps too many records

end-if

else

x = Q.pop()

if (x==NULL)

output Queue POP FAILS - pehaps popping empty queue

end-if

end-if

else

break

closeFile(f);