Data Structures - Stacks

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, what is the number of elements present on the stack

Which form of access is used to add remove nodes from a stack?

• LIFO

• FIFO

• LILO

What method is used to add an element to a Stack?

• add()

• enqueue()

• push()

• pop()

What method is used to return an element from a stack without removing it?

• dequeue()

• NextItem()

• peek()

• pop()

If the element "A B C D" are placed in a stack and are deleted one at a time

in what order will they be removed?

• ABCD

• DBCA

• DCBA

• DABC

Which of these data structures is LIFO?

• Stack

• Queue

• Binary Tree

• Double linked list

Storage for data defined in terms of set of operations to be performed on the data

• Arrays

• Variables

• Abstract Data Types

• Data Types

Stack is also called as

• Last in first out

• First in last out

• Last in last out

• First in first out

In stack insertion and deletion can take place only at one end call the ____________________ of the stack.

• Path

• Function

• Top

• Bottom

The mechanism for passing parameters, return addresses and local variables is referred to as the ____