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

## Data Structure Questions and Answers-Stack Operations

Question 1 |

The postfix form of the expression (A+ B)*(C*D- E)*F / G is?

AB+ CD*E - FG /** | |

AB + CD* E - F **G / | |

AB + CD* E - *F *G / | |

AB + CDE * - * F *G / |

**Puzzles Questions answers**

Question 1 Explanation:

Applying the postfix expression evaluation.

Question 2 |

The data structure required to check whether an expression contains balanced parenthesis is?

Stack | |

Queue | |

Array | |

Tree |

**Puzzles Questions answers**

Question 3 |

What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?

Linked List | |

Stack | |

Queue | |

Tree |

**Journalism Questions answers**

Question 4 |

The process of accessing data stored in a serial access memory is similar to manipulating data on a .....

Heap | |

Binary Tree | |

Array | |

Stack |

**Journalism Questions answers**

Question 5 |

The postfix form of A*B+C/D is?

*AB/CD+ | |

AB*CD/+ | |

A*BC+/D | |

ABCD+/* |

**Library science Questions answers**

Question 5 Explanation:

Applying the postfix expression evaluation.

There are 5 questions to complete.