Time Left - 15:00 mins
Stack Applications I Starter Quiz
Attempt now to get your rank among 83 students!
Question 1
Which type of stack is used in infix to postfix conversion of an expression:
Question 2
Suppose an array implementation of stack with nine items are pushed into the stack stored at array [1] through array [9]. Where does the push operation place the new entry in the array?
Question 3
The postfix expression for the infix expression
(A + B *(C + D))/ (F + D * E) is
(A + B *(C + D))/ (F + D * E) is
Question 4
Evaluation of the given postfix expression
10 10 + 60 6/*8 – is:
Question 5
The postfix expression to be evaluated as 30 is ?
Question 6
Which of the following stack permutation can’t be obtained or the input sequence 1, 2, 3, 4, 5, 6?
Question 7
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?
- 83 attempts
- 0 upvotes
- 1 comment
Tags :
GATE & PSU CSGeneralJul 6GATE & PSU CS
