Scribd Logo
Upload

Welcome to Scribd!

  • Including Their Characteristics: Usage

    Uploaded by

    henk
    11 views2 pages
    Stacks and queues are common data structures. A stack follows LIFO (last in, first out) order, like a stack of plates. A queue follows FIFO (first in, first out) order, like a line at a bank. The document asks the student to describe stacks and queues, provide examples of each in daily life, demonstrate adding and removing elements from each with a series of steps using the letters A-F, convert an infix expression to postfix and vice versa, and convert a prefix expression to infix. The student is also asked to show the states of a stack at each step of evaluating a postfix expression.

    Original Description:

    123

    Original Title

    CH3小考

    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
    Stacks and queues are common data structures. A stack follows LIFO (last in, first out) order, like a stack of plates. A queue follows FIFO (first in, first out) order, like a line at a bank. The document asks the student to describe stacks and queues, provide examples of each in daily life, demonstrate adding and removing elements from each with a series of steps using the letters A-F, convert an infix expression to postfix and vice versa, and convert a prefix expression to infix. The student is also asked to show the states of a stack at each step of evaluating a postfix expression.

    Copyright:

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

    Including Their Characteristics: Usage

    Uploaded by

    henk
    Stacks and queues are common data structures. A stack follows LIFO (last in, first out) order, like a stack of plates. A queue follows FIFO (first in, first out) order, like a line at a bank. The document asks the student to describe stacks and queues, provide examples of each in daily life, demonstrate adding and removing elements from each with a series of steps using the letters A-F, convert an infix expression to postfix and vice versa, and convert a prefix expression to infix. The student is also asked to show the states of a stack at each step of evaluating a postfix expression.

    Copyright:

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

    Data Structure Ch3 Class:__________ Name:__________ Student ID:__________

    1 Please describe “Stack” & “Queue” including their characteristics and usage. Give an example for each
    other in daily life.(20%)

    2 We use following two data structure (a) and (b) to deal with six elements {A,B,C,D,E,F} by following
    steps:(30%)
    step 1:Add two elements {A, B}.
    step 2:Delete one element.
    step 3:Add three elements {C,D,E}.
    step 4:Delete two elements.
    step 5:Add one element {F}.
    step 6:Delete two elements.
    Please show the state of each step in (a)”Stack” & (b)”Queue”.
    3 Please show the results of:
    (a)Transpose “A+B*(C-D)/E+F” to postfix.(5%)
    (b)Transpose “+A*-BC-DE” to infix.(5%)
    (c)Transpose “ABC/DE+*-” to Prefix.(10%)

    4 Please show each state of the postfix of 3.(a) with using a stack.(30%)

    You might also like