Scribd Logo
Upload

Welcome to Scribd!

  • Micro

    Uploaded by

    rathulsreeku123
    4 views2 pages
    The document describes four algorithms: 1) A push operation algorithm for a stack that checks for overflow before adding a value to the stack. 2) A pop operation algorithm for a stack that checks for underflow before removing a value from the stack. 3) A deletion algorithm for a queue that removes the front value if not empty and resets pointers if empty. 4) An insertion algorithm for a queue that initializes pointers for an empty queue, increments the rear pointer to add a value if not full, and prints an overflow message if full.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes four algorithms: 1) A push operation algorithm for a stack that checks for overflow before adding a value to the stack. 2) A pop operation algorithm for a stack that checks for underflow before removing a value from the stack. 3) A deletion algorithm for a queue that removes the front value if not empty and resets pointers if empty. 4) An insertion algorithm for a queue that initializes pointers for an empty queue, increments the rear pointer to add a value if not full, and prints an overflow message if full.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views2 pages

    Micro

    Uploaded by

    rathulsreeku123
    The document describes four algorithms: 1) A push operation algorithm for a stack that checks for overflow before adding a value to the stack. 2) A pop operation algorithm for a stack that checks for underflow before removing a value from the stack. 3) A deletion algorithm for a queue that removes the front value if not empty and resets pointers if empty. 4) An insertion algorithm for a queue that initializes pointers for an empty queue, increments the rear pointer to add a value if not full, and prints an overflow message if full.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Push Operation Algorithm Deletion Algorithm

    Start Start

    1: If (TOS<N) Then 1: If (FRONT > -1 AND FRONT < REAR) Then

    2: TOS =TOS +1 2: VAL = Q[FRONT]

    3: STACK[TOS] = VAL 3: FRONT=FRONT +1

    4: Else 4: Else

    5: Print "Stack Overflow” 5: Print "Queue Underflow "

    6: End of If 6: End of If

    Stop 7: If (FRONT > REAR) Then

    Pop Operation Algorithm 8: FRONT REAR = -1

    Start 9: End of If

    1: If (TOS-1) Then stop

    2:VAL = STACK[TOS]

    3:TOS = TOS-1

    4: Else

    5:Print "Stack Underflow"

    3: End of If

    Stop

    Insertion Algorithm

    Start

    1: If (REAR == -1) Then

    2:FRONT REAR = 0

    3: Q[REAR] = VAL

    4: Else If (REAR < N) Then

    5: REAR REAR +1

    6: Q[REAR] = VAL

    7: Else

    8: Print "Queue Overflow "

    9: End of If

    Stop

    You might also like