Recent questions tagged stack

Given a stack $S$ with $5$ elements from top to bottom as:$2, 4, 6, 8, 10$and an empty queue $Q$.First, remove the elements one by one from $S$ and insert them into $Q$.T...

Which of the following statements are true?$\text{S1.}$ Stack operations $\texttt{push}$, $\texttt{pop}$, and $\texttt{isEmpty}$ can be worst-case $O(1)$ for a linked-lis...

Assume there are $n$ elements in the data structure. Consider the following statements:$\text{S1}:$ A stack can be implemented using a linked list such that each individu...

A queue is to be implemented using two stacks and only a constant amount of extra memory. Which of the following correctly implements queue behavior with constant amortiz...

Consider the following Python code fragment:stack = [] while len(q) 0: stack.append(q.pop(0)) while len(stack) 0: q.append(stack.pop())Here, $\texttt{q.pop(0)}$ removes...

Consider the following stack-based Python code:stack = [] n = 50 while n 0: stack.append(n % 2) n = n // 2 while len(stack) 0: print(stack.pop(), end="")What is printed...

A stack is used to check whether parentheses, braces, and brackets are properly balanced.Consider the following two inputs:Input $1: \texttt{[()]\{\}\{[()()]()\}}$Input $...

Suppose an intermixed sequence of stack push and pop operations is performed. The push operations push the integers $0$ through $9$ in order. The pop operations print the...

A stack client reads tokens from left to right. If the token is a word, it is pushed onto the stack. If the token is $\texttt{-}$, one item is popped and printed.Consider...

A queue is implemented using two stacks $\text{S1}$ and $\text{S2}$.Use the implementation where $\texttt{dequeue()}$ is $\text{O(1)}$ by keeping the front of the queue a...

Which of the following statements is true about arithmetic expressions?Parentheses are needed in all arithmetic expressions. Infix expressions do not require precedence r...

Which of the following permutations can be obtained in the same order using a stack, assuming the input sequence is:$$5, 6, 7, 8, 9$$$7, 8, 9, 5, 6$ $5, 9, 6, 7, 8$ $7, 8...

If the following sequence of operations is performed on an initially empty stack:push(1), push(2), pop, push(1), push(2), pop, pop, pop, push(2), popwhat is the sequence ...

An initially empty stack undergoes the following operations:push(40) push(10) push(10) push(pop() + pop()) push(20) push(5) push(pop() / pop())Assume the division operati...

Arrange the following prefix expressions in ascending order on the basis of their values.$-\:*\: 2\: /\: 8\:4\:3$$\uparrow \:- \:* \: 3\:6\:*\: 4\:2\:5$$+\:-\:\uparrow \:...

Consider a stack $S$ and a queue $Q$. Both of them are initially empty and have the capacity to store ten elements each. The elements $1,2,3,4$, and $5$ arrive one by one...

How can we implement a doubly linked list to build a stack and find the median? What would be the time complexity (insertion, deletion and median) ?

You were given an array of distinct elements of size n with indices starting from 0.-Every $(2i)^{th}$ element is pushed into a stack.-Every $(2i+1)^{th}$ element is enqu...

Consider the following infix expression $Q:\left((A+B)^{*} D\right) \uparrow(E-F)$. The equivalent postfix expression of $Q$ is$A B+D ^{*} E F \uparrow$ -$A B+D^{*}-\upar...

The entire set of parameters, including return address that is stored for a procedure invocation is referred tostack framestack basestack limitstack record

Which of the following uses only increment operations for adding and removing element at either end?QueuesStacksPriority QueuesDeques

What is the result of evaluating the postfix expression "$43^{*} 25^{*}+b-$ " ?$8$$14$$10$$5$