71. The time complexity of converting a prefix notation to infix notation is . . . . . . . .
72. What will be the output of the following program?
main()
{
char str[]="hello india";
int len = strlen(str);
int i;
for(i=0;i<len;i++)
push(str[i]); // pushes an element into stack
for(i=0;i<len;i++)
pop(); //pops an element from the stack
}
main()
{
char str[]="hello india";
int len = strlen(str);
int i;
for(i=0;i<len;i++)
push(str[i]); // pushes an element into stack
for(i=0;i<len;i++)
pop(); //pops an element from the stack
}73. Which is the most appropriate data structure for reversing a word?
74. What is the number of moves required to solve Tower of Hanoi problem for k disks?
75. The postfix expression abc+de/*- is equivalent to which of the following infix expression?
76. An error is thrown if the character '\n' is pushed in to the character stack.
77. Which of the following is valid reverse polish expression?
78. The prefix expression of the postfix expression AB+CD-* is . . . . . . . .
79. Which of these operators have the highest order of precedence?
80. From the given expression tree, identify the infix expression, evaluate it and choose the correct result.
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.