Q. The postfix form of A*B+C/D is

View solution

Q. Let the following circular queue can accommodate maximum six elements with the following data
front = 2 rear = 4
queue = _______, L, M, N, ___, ___

What will happen after ADD O operation takes place?

View solution

Q. What is the postfix form of the following prefix:
*+ab–cd

View solution

Q. A queue is a,

View solution

Q. Which data structure is needed to convert infix notation to postfix notation?

View solution

Q. The prefix form of A-B/ (C * D ^ E) is,

View solution

Q. What is the result of the following operation:
Top (Push (S, X))

View solution

Q. The prefix form of an infix expression p + q − r t* is

View solution

Q. Which data structure is used for implementing recursion?

View solution

Q. The equivalent prefix expression for the following infix expression (A+B)-(C+D*E)/F*G is

View solution

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

View solution

Q. In Reverse Polish notation, expression A*B+C*D is written as

View solution

Q. __________is a linear data structure in which an element can be added or removed only at one end.

View solution

Q. In stack terminology, the __________operations are known as push and pop operations respectively.

View solution

Q. A stack works on the principle of____________.

View solution

Q. A common example of a queue is people waiting in line at a__________.

View solution

Q. What is one of the common examples of a stack?

View solution

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