Which of the following sequences are not stack permutations of 0,1,2,3,4,5,6,7,8,9? There could be more than one answer: select all those that you think are correct. There is a penalty for incorrect choices. Group of answer choices 4, 6, 8, 7, 5, 3, 2, 9, 0, 1 4, 3, 2, 1, 0, 9, 8, 7, 6, 5 2, 5, 6, 7, 4, 8, 9, 3, 1, 0 0, 4, 6, 5, 3, 8, 1, 7, 2, 9

Which of the following sequences are not stack permutations of 0,1,2,3,4,5,6,7,8,9? There could be more than one answer: select all those that you think are correct. There is a penalty for incorrect choices. Group of answer choices 4, 6, 8, 7, 5, 3, 2, 9, 0, 1 4, 3, 2, 1, 0, 9, 8, 7, 6, 5 2, 5, 6, 7, 4, 8, 9, 3, 1, 0 0, 4, 6, 5, 3, 8, 1, 7, 2, 9

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 1TF

See similar textbooks

Similar questions

A stack allows three operations - push, pop and top. Operation push puts the input element at the top of the stack. Operation pop takes the top element out of the stack and returns it to the caller. Operation top only returns the top element of the stack without deleting it from the top of the stack. Consider an initially empty stack of English words. Let us consider the following operations (separated by semicolons) on the stack. top; push where; top; push the; push mind; top; push has; pop; push is; top; push without; push dear; pop; push fear; top; push and; push the; top; push bed; pop; top; push head; top; push is; push held; push high; From this point on, we continue executing only the operation pop on the stack, until the stack is empty. The output of these pop operations only is as follows. highheldisheadtheandfearwithoutismindthewhere Note that there is no space on either side of the words printed by the pop operation. This ends the first phase of operations on the stack.…
Given that a stack starts like this: 4 12 10 2 3 Give the output of a stack if the following instructions are executed: Push (25); Push (9); Push (73); Pop (), Pop, Pop Select one: A. 9 73 10 B. 4 12 10 2 3 C. 73 9 25 D. 4 12 25 73
A counter automaton is a pushdown automaton that only uses one stack symbol (in additionto the bottom of the stack marker). This means that the stack acts as a simple counter: the push operationincreases the counter, the pop operation decreases it, and you can check if the counter is currently set to 0by looking for the bottom of the stack. In particular, you can not store a string over an arbitrary alphabeton the stack. For example, the automaton for anbn we have seen in class is a counter automaton.Let L = {w ∈{a, b}∗|w contains the same number of symbols a and b}.(2.a) Build a counter automaton accepting the language L. As in Question 1, describe the algorithmused by your automaton, and draw a transition diagram.(2.b) Write down an accepting computation of your automaton on the string abbbabaa.
Suppose you have a stack with a maximum size of 1000 elements and you want to perform the following operations: Push 500 elements onto the stack. Pop 200 elements from the stack. Push 800 elements onto the stack. Pop all remaining elements from the stack. What is the final size of the stack after performing all these operations?
A SpecialStackTM is a stack modified to support the following two operations: PUSHCLEAR(v) successively pops consecutive items from the top of the stack that are less than u, then pushes v onto the stack. POP() deletes the item at the top of the stack. Assume these operations are implemented using a singly-linked list. PUSHCLEAR(v) iter- ates through the linked list to pop the applicable items and then adds v to the beginning. POP() deletes the first item. (a) Describe the ordering of values on the stack. (b) Explain how a single call to PUSHCLEAR(V) could take (n) time. (c) If we assume that every operation takes linear time, we get a naive bound of O(n²) on the total runtime. But this doesn't consider the fact that these expensive operations happen infrequently so let's analyze it more closely. Show that any sequence of n operations takes O(n) time. -
Given a stack, switch_pairs function takes a stack as a parameter and thatswitches successive pairs of numbers starting at the bottom of the stack.For example, if the stack initially stores these values:bottom [3, 8, 17, 9, 1, 10] topYour function should switch the first pair (3, 8),the second pair (17, 9), ...:bottom [8, 3, 9, 17, 10, 1] topif there are an odd number of values in the stack, the value at the top of thestack is not moved: For example:bottom [3, 8, 17, 9, 1] topIt would again switch pairs of values, but the value at thetop of the stack (1)would not be movedbottom [8, 3, 9, 17, 1] topNote: There are 2 solutions:first_switch_pairs: it uses a single stack as auxiliary storagesecond_switch_pairs: it uses a single queue as auxiliary storage""".
If the sequence of operations "push(9), push(6), push(7), pop(), push(8), pop0, push(5), pop), push(4), pop0, push(7), pop(), pop()" are performed on an initially empty stack, the sequence of popped out values is: 785476 77569 96577 674587
A CapnStackSparrow is an extended stack that supports four main operations: the standard Stack operations push(x) and pop() and the following non-standard operations:• max(): returns the maximum value stored on the Stack.• ksum(k): returns the sum of the top k elements on the Stack.The zip file gives an implementation SlowSparrow that implements these operations so that push(x) and pop() each run in ?(1) time, but max() and ksum(k) run in ?(?) time. For this question, you should complete the implementation of FastSparrow that implements all four operations in ?(1) (amortized) time per operation. As part of your implementation, you may use any of the classes in the Java Collections Framework and you may use any of the source code provided with the Java version of the textbook. Don't forget to also implement the size() and iterator() methods. Think carefully about your solution before you start coding. Here are two hints:1. don't use any kind of SortedSet or SortedMap, these all require…
Pseudocodes can be written using the operations PUSH(S,X), POP(S,X), PRINT(X), EMPTY STACK(S), and TOP OF STACK(S), which returns the top element of stack S. i) assign X to the bottom element of stack S, leaving the stack empty;ii) assign X to the bottom element of the stack, leaving the stack unchanged;iii) assign X to the nth element in the stack (from the top), leaving the stack unchanged.
Given queue of integers and an integer k, write a program to remove the first k elements of the queue, reverse their order and append them at the end of the queue, leaving the other elements in the same relative order. Only a stack can be used as an auxiliary space and the following standard operations are allowed on queue. • enqueue(x) : Add an item x to rear of queue dequeue(): Remove an item from front of queue Examples: Input: Q = 10, 20, 30, 40, 50, 60, 70, 80, 90, 100, k =5 Output: Q = 60, 70, 80, 90, 100, 50, 40, 30, 20, 10 Input: Q = 10, 20, 30, 40, 50, 60, 70, 80, 90, 100, k-2 Output: Q = 30, 40, 50, 60, 70, 80, 90, 100, 20, 10
Many real-world situations correspond to a stack. For example, a pile of trays in a cafeteria is a stack since the last tray put on the pile is the first tray used. Think of other real-world stacks and describe the push and pop operations on these.
Code in C One of the applications of a stack is to backtrack - that is, to retrace its steps. As an example, imagine we want to read a list of items, and each time we read a negative number we must backtrack and print the five numbers that come before the negative number and then discard the negative number. Use a stack to solve this problem. Use a stack and push them into the stack (without printing them) until a negative number is read. At this time, stop reading and pop five items from the stack and print them. If there are fewer than five items in the stack, print an error message and stop the program. After printing the five items, resume reading data and placing them in the stack. When the end of the file is detected, print the message and the items remaining in the stack. Sample Output 1 2 3 4 5 6 7 -1 7 6 5 4 3 9 6 4 3 -2 3 4 6 9 2 -3 Number of items left is less than five! Program is terminating! Project name : Backtrack Filenames: backtrack.h, backtrack.c,…