Accessing top element in stack is constant time operation.

• TRUE

• FALSE

Only top element can be accessed in stack

• TRUE

• FALSE

Stacks have LIFO ordering

• TRUE

• FALSE

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

• AB + CDE * - * F *G /

• AB+ CD*E - FG /**

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

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

Act of adding values into a stack is called

• Popping

• Polling

• Pushing

• None

The prefix form of A-B/ (C * D ⋀ E) is?

• -/*⋀ACBDE

• -ABCD*⋀DE

• -A/B*C⋀DE

• -A/BC*⋀DE

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

• *AB/CD+

• AB*CD/+

• A*BC+/D

• ABCD+/*

Which of the following statement(s) about stack data structure is/are NOT correct?

• Stack data structure can be implemented using linked list

• New node can only be added at the top of the stack

• Stack is the FIFO data structure

• The last node at the bottom of the stack has a NULL link

If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, in what order will they be removed?

• ABCD

• DCBA

• DCAB

• ABDC

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 no of element present on stack are

• 1

• 2

• 3

• 4