Q. Which of the following is an application of stack?

View solution

Q. Which of the following name does not relate to stacks?

View solution

Q. The term "push" and "pop" is related to the

View solution

Q. A data structure where elements can be added or removed at either end but not in the middle

View solution

Q. Which data structure allows deleting data elements from front and inserting at rear?

View solution

Q. The postfix form of the expression (A + B)∗(C∗D − E)∗F / G is

View solution

Q. What is the postfix form of the following prefix expression -A/B*C$DE ?

View solution

Q. The minimum number of multiplications and additions required to evaluate the polynomial
P = 4x3+3x2-15x+45 is

View solution

Q. The data structure required to evaluate a postfix expression is

View solution

Q. The data structure required to check whether an expression contains balanced parenthesis is

View solution

Q. What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?

View solution

Q. The process of accessing data stored in a serial access memory is similar to manipulating data on a

View solution

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