Data Structure Questions and Answers-Stack Operations

 

 Help authour, Buy PDF Ebook   >>>Click Here<<<

Data Structure Questions and Answers-Stack Operations

Question 1
The result of evaluating the postfix expression 5, 4, 6, +, *, 4, 9, 3, /, +, * is?
A
600
B
350
C
650
D
588
Reasoning Questions answers
Question 2
Convert the following infix expressions into its equivalent postfix expressions

(A + B $\wedge$D)/(E - F)+G

A
(A B D $\wedge$ + E F - / G +)
B
(A B D +$\wedge$ E F - / G +)
C
(A B D $\wedge$ + E F/- G +)
D
None of the mentioned
ICT Questions answers
Question 2 Explanation: 
Applying the postfix expression evaluation.

Question 3
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.

A
xyz*+pq*r+s*+
B
xyz*+pq*r+s+*
C
xyz+*pq*r+s*+
D
None of the mentioned
Sociology Questions answers
Question 3 Explanation: 
Applying the postfix expression evaluation.

Question 4
Which of the following statement(s) about stack data structure is/are NOT correct?
A
Linked List are used for implementing Stacks
B
Top of the Stack always contain the new node
C
Stack is the FIFO data structure
D
Null link is present in the last node at the bottom of the stack
GK Questions answers
Question 4 Explanation: 
Stack follows LIFO.

Question 5
Consider the following operation performed on a stack of size 5.

Push(1);

Pop();

Push(2);

Push(3);

Pop();

Push(4);

Pop();

Pop();

Push(5);

After the completion of all operation, the number of elements present in stack are

A
1
B
2
C
3
D
4
Biology Questions answers
There are 5 questions to complete.

 

 Help authour, Buy PDF Ebook   >>>Click Here<<<