Q. When a stack is organized as an array, a variable named Top is used to point to the top element of the stack. Initially, the value of Top is set to_______to indicate an empty stack.

View solution

Q. What happens when the stack is full and there is no space for a new element, and an attempt is made to push a new element?

View solution

Q. The total number of elements in a stack at a given point of time can be calculated from the value of______.

View solution

Q. Jan Lukasiewicz, who suggested two alternative notations to represent an arithmetic expression belonged to which nationality?

View solution

Q. In a computer system, when an __________ expression in an infix notation needs to be evaluated, it is first converted into its postfix notation?

View solution

Q. The postfix form of the following infix notation is :

(A + B)* (C*D − E)* F

View solution

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