vb.net code to generate barcode public E bottom() // returns the bottom element of this stack in Java

Creator EAN-13 Supplement 5 in Java public E bottom() // returns the bottom element of this stack

CHAP. 5]

5.23 Add this member method to the ArrayStack class shown in Example 5.3 on page 104:

5.24 Add this member method to the LinkedStack class shown in Example 5.4 on page 106:

5.1 5.2 Stacks are called LIFO structures because the last element that is inserted into a stack is always the first element to be removed. LIFO is an acronym for last-in-first-out. a. No, because a LILO structure would mean last-in-last-out, which is just the opposite of the lastin-first-out protocol. b. Yes, because a FILO structure would mean first-in-last-out, which is the same as a last-in-firstout protocol. a. The prefix notation for arithmetic expressions places binary operators ahead of both of their operands. For example, the expression x + 2 is written + x 2 in prefix notation. The standard functional notation used in mathematics uses prefix notation: f(x), sinx, and so on. b. The infix notation for arithmetic expressions places binary operators between their operands. Infix notation is the usual format for arithmetic expressions, for example, x + 2. c. The postfix notation for arithmetic expressions places binary operators after both of their operands. For example, the expression x + 2 is written x 2 + in postfix notation. The factorial function in mathematics uses postfix notation: n!. a. b. c. d. True, because (x + y) + z = x + (y + z). True, because (x + y) z = x + (y z). False, because (x y) + z x (y + z). False, because (x y) z x (y z).

5.1 5.2

a. ( a * b + c ) / d e ) b. (a b) / ( c * ( d + e ) ) c. a / ( b + ( c * ( d e ) ) ) a. a b * c + d / e b. a b c d e + * / c. a b c d e * + / a. ( a + b ) ( c / ( d + e ) ) = + a b / c + d e b. a / ( ( b / c ) * ( d e ) ) = / a * / b c d e c. (a / ( b / c ) ) * ( d e ) = * / a / b c d e a. ( a + b ) ( c / ( d + e ) ) = a b + c d e + / b. a / ( ( b / c ) * ( d e ) ) = a b c / d e * / c. (a / ( b / c ) ) * ( d e ) = a b c / / * d e * a. (a + b) / (c d) + e b. a ( b + c ) * ( d e ) c. a / ( b / ( c / ( d / e ) ) )

public static <E> Deque<E> reversed(Deque<E> stack) { // returns a new stack that contains the same elements as the given // stack, but in reversed order Deque<E> stack1 = new ArrayDeque<E>(); while(!stack.isEmpty()) { stack1.push(stack.pop()); } return stack1; } public static <E> Deque<E> reversed(Deque<E> stack) { // returns a new stack that contains the same elements as the given // stack, but in reversed order, and leaves the given stack in its // original state Deque<E> stack1 = new ArrayDeque<E>(); Deque<E> stack2 = new ArrayDeque<E>(); while(!stack.isEmpty()) { stack1.push(stack.peek()); stack2.push(stack.pop()); } while(!stack2.isEmpty()) { stack.push(stack2.pop()); } return stack1; } public static <E> void reverse(Deque<E> stack) { // reverses the contents of the specified stack Deque<E> stack1 = new ArrayDeque<E>(); Deque<E> stack2 = new ArrayDeque<E>(); while(!stack.isEmpty()) { stack1.push(stack.pop()); } while(!stack1.isEmpty()) { stack2.push(stack1.pop()); } while(!stack2.isEmpty()) { stack.push(stack2.pop()); } } public static <E> E penultimate(Deque<E> stack) { // returns the second from the top element of the specified stack E x1 = stack.pop(); E x2 = stack.peek(); stack.push(x1); return x2; } public static <E> E popPenultimate(Deque<E> stack) { // removes and returns the second element of the specified stack E x1 = stack.pop(); E x2 = stack.pop(); stack.push(x1); return x2; } public static <E> E bottom(Deque<E> stack) { // returns the bottom element of the specified stack Deque<E> stack1 = new ArrayDeque<E>();

CHAP. 5]