Q. What are the sequence of popped out values if the sequence of operations - push(1), push(2), pop, push(1), push(2), pop, pop, pop, push(2), pop are performed on a stack.

View solution

Q. In conversion from prefix to postfix using stack data-structure, if operators and operands are pushed and popped exactly once, then the run-time complexity is ............

View solution

Q. push() and pop() functions are found in ...............

View solution

Q. The result of evaluating the following postfix expression is
5, 7, 9, *, +, 4, 9, 3, /, +, -

View solution

Q. An infix expression can be converted to a postfix expression using a .................

View solution

Q. A data structure in which an element is added and removed only from one end, is known as

View solution

Q. The data structure needed to convert a recursion to an iterative procedure is ............

View solution

Q. The prefix form of an infix expression A+B-C*D is

View solution

Q. One can determine whether an infix expression has balanced parenthesis or not by using .............

View solution

Q. n elements of a Queue are to be reversed using another queue. The number of “ADD” and “REMOVE” operations required to do so is:

View solution

Q. One can convert an infix expression to a postfix expression using a ..............

View solution

Q. Which of the following types of expressions do not require precedence rules for evaluation?

View solution

Q. The postfix form of A ^ B * C - D + E/ F/ (G + H)

View solution

Q. The prefix of (A+B)*(C-D)/E*F is:

View solution

Q. Stack in Data Structure is ___________.

View solution

Q. In the stack process of inserting an element in the stack is called as ___________.

View solution

Q. Process of Removing element from the stack is called as __________.

View solution

Q. In the stack, If user try to remove element from the empty stack then it called as ___________.

View solution

Q. User push 1 element in the stack having already five elements and having stack size as 5 then stack becomes ___________.

View solution

Q. User perform following operations on stack of size 5 then -

push(1);
pop();
push(2);
push(3);
pop();
push(4);
pop();
pop();
push(5);

at the end of last operation, total number of elements present in the stack are -

View solution