Scribd Logo
Upload

Welcome to Scribd!

  • Cicular Queue

    Uploaded by

    Gopal Mishra
    7 views2 pages
    This COBOL program implements a circular queue data structure. It uses an array AA with 100 elements to store items in the queue. Index I tracks the insertion point and index D tracks the removal point. The program displays a menu to insert or retrieve items from the queue and handles wrapping the indexes when reaching the end of the array.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    ODT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This COBOL program implements a circular queue data structure. It uses an array AA with 100 elements to store items in the queue. Index I tracks the insertion point and index D tracks the removal point. The program displays a menu to insert or retrieve items from the queue and handles wrapping the indexes when reaching the end of the array.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as ODT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views2 pages

    Cicular Queue

    Uploaded by

    Gopal Mishra
    This COBOL program implements a circular queue data structure. It uses an array AA with 100 elements to store items in the queue. Index I tracks the insertion point and index D tracks the removal point. The program displays a menu to insert or retrieve items from the queue and handles wrapping the indexes when reaching the end of the array.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as ODT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Object 1

    COBOL CIRCULAR QUEUE AIM: IMPLEMENT A QUEUE STRUCTURE IN COBOL ****** ***************************** Top of Data ************************************** IDENTIFICATION DIVISION. PROGRAM-ID. MAC. DATA DIVISION. WORKING-STORAGE SECTION. 01 A. 05 AA PIC X(5) OCCURS 100 TIMES INDEXED BY I D. 01 B PIC X(5). 01 C PIC 9. PROCEDURE DIVISION. 0001. SET I TO 0. SET D TO 1. 00A. DISPLAY "MENU". DISPLAY "1.INSERT". DISPLAY "2.RETRIVE". DISPLAY "3.EXIT". ACCEPT C. IF C = 1 PERFORM 0002 DISPLAY "ITEM INSERTED" ELSE IF C = 2 GO 0003 ELSE STOP RUN. GO 00A. 0002. IF I > 100 SET I TO 1 DISPLAY "QUEUE CIRCULARED". DISPLAY "ENTER VALUE ". ACCEPT B. SET I UP BY 1. MOVE B TO AA ( I ). 0003. IF D > I DISPLAY "QUEUE EMPTY" GO 00A. MOVE AA ( D ) TO B. DISPLAY "ITEM RECEIVED:" B. SET D UP BY 1. IF D > 100 SET D TO 1. GO 00A. ****** **************************** Bottom of Data ************************************ //Compatible with all compilers & version SAMPLE OUTPUT

    MENU 1.INSERT

    2.RETRIVE 1 VALUE ITEM INSERTED MENU 1.INSERT 2.RETRIVE 1 VALUE ITEM INSERTED MENU 1.INSERT 2.RETRIVE 2 MENU 1.INSERT 2.RETRIVE 2 19 28

    3.EXIT ENTER

    3.EXIT ENTER

    3.EXIT ITEM RETRIEVED: 28

    3.EXIT ITEM RETRIEVED: 19

    You might also like