Implementation of Stacks and Queues

The process of inserting an element in a stack is called ____________

• Create

• Push

• Evaluation

• Pop

The process of removing an element from a stack is called ____________

• Create

• Push

• Evaluation

• Pop

Pushing an element into a stack that already contains five elements and astack size of 5, results in a stack

• Overflow

• Crash

• Underflow

• User flow

Entries in a stack are “ordered”. What is the meaning of this statement?

• A collection of stacks is sortable

• Stack entries may be compared using the ‘<’ operation

• The entries are stored in a linked list

• There is a sequential entry that is one by one

Which of the following applications does not use a stack?

• A parentheses balancing program

• Tracking of local variables at run time

• Compiler Syntax Analyzer

• Data Transfer between two asynchronous process

What is the value of the postfix expression 6 3 2 4 + – *:

• 1

• 40

• 74

• -18

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 /

Answer explanation

Best explanation: (((A+ B)*(C*D- E)*F) / G) is converted to postfix expression as

(AB+(*(C*D- E)*F )/ G)

(AB+CD*E-*F) / G

(AB+CD*E-*F G/).

Thus Postfix expression is AB+CDE-*F*G/

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

• Stack

• Queue

• Array

• Tree

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

• *AB/CD+

• AB*CD/+

• A*BC+/D

• ABCD+/*

Which data structure is used for implementing recursion?

• Queue

• Stack

• Array

• List