Post an enquiry and get instant responses from coaching classes.Post Requirement
A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a ?Topic: C, C++
If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, what is the order of removal?Topic: C# (C Sharp)
Assume that the operators +,-, X are left associative and ^ is right associative.
The order of precedence (from highest to lowest) is ^, X, +, -. The postfix expression for the infix expression a + b X c – d ^ e ^ f is
The type of expression in which operator succeeds its operands is?Topic: C# (C Sharp)
Which of the following is not an inherent application of stack?Topic: C, C++
Consider the following operation performed on a stack of size 5.
After the completion of all operation, the number of elements present in stack are
Which of the following statement(s) about stack data structure is/are NOT correct?Topic: C# (C Sharp)
Convert the following Infix expression to Postfix form using a stack
x + y * z + (p * q + r) * s, Follow usual precedence rule and assume that the expression is legal.