# Data Structure Questions and Answers-Stack Operations

## Data Structure Questions and Answers-Stack Operations

 Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
The postfix form of the expression (A+ B)*(C*D- E)*F / G is?
 A AB+ CD*E - FG /** B AB + CD* E - F **G / C AB + CD* E - *F *G / D AB + CDE * - * F *G /
Question 1 Explanation:
Applying the postfix expression evaluation.

 Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
The data structure required to check whether an expression contains balanced parenthesis is?
 A Stack B Queue C Array D Tree
 Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?
 A Linked List B Stack C Queue D Tree
 Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
The process of accessing data stored in a serial access memory is similar to manipulating data on a .....
 A Heap B Binary Tree C Array D Stack
 Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
The postfix form of A*B+C/D is?
 A *AB/CD+ B AB*CD/+ C A*BC+/D D ABCD+/*
Question 5 Explanation:
Applying the postfix expression evaluation.

There are 5 questions to complete.