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

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

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

Which of the following is correct statement for stack ?

View solution

Q. What will be the postfix expression for following infix expression:

b * c + d / e

View solution

Q. What will be the postfix expression for following infix expression -
A / B ^ C - D

View solution

Q. What will be the postfix expression for following infix expression -
A + B * C ^ D

View solution

Q. Evaluate Postfix expression from given infix expression.
A + B * (C + D) / F + D * E

View solution

Q. Expression in which Operator is written after Operand is called as ________.

View solution

Q. Which of the following is an example of Postfix expression ?

View solution

Q. Convert the following infix expression to postfix expression -
A / B ^ C + D * E - A * C

View solution

Q. Convert the following infix expression to postfix expression -
B * C - C + D / A / ( E + E )

View solution

Q. In Computer generally _________ expressions are preferred.

View solution

Q. Data Structure required to evaluate infix to postfix is __________.

View solution