31. How many types of input characters are accepted by this algorithm?
32. Consider the postfix expression 4 5 6 a b 7 8 a c, where a, b, c are operators. Operator a has higher precedence over operators b and c. Operators b and c are right associative. Then, equivalent infix expression is
33. In infix to postfix conversion algorithm, the operators are associated from?
34. Which of the following is an infix expression?
35. Evaluate and write the result for the following postfix expression
abc*+de*f+g*+ where a=1, b=2, c=3, d=4, e=5, f=6, g=2.
abc*+de*f+g*+ where a=1, b=2, c=3, d=4, e=5, f=6, g=2.
36. For the given expression tree, write the correct postfix expression.
37. In the given C snippet, find the statement number that has error.
//C code to push an element into a stack
void push( struct stack *s, int x)
{
if(s->top==MAX-1)
{
printf(“stack overflow”);
}
else
{
s->items[++s->top]=x;
s++;
}
}
//C code to push an element into a stack
void push( struct stack *s, int x)
{
if(s->top==MAX-1)
{
printf(“stack overflow”);
}
else
{
s->items[++s->top]=x;
s++;
}
}38. Operations required for reversing a word or a string using stack are push() and pop().
39. In balancing parentheses algorithm, the string is read from?
40. What will be the word obtained if the word "abbcabb" is reversed using a stack?
Read More Section(Stacks in Data Structures)
Each Section contains maximum 100 MCQs question on Stacks in Data Structures. To get more questions visit other sections.