Data Structures: Stacks

Which principle does a stack data structure operate on?

From which end of a stack can elements be inserted and removed?

Which term describes adding an element to the top of a stack?

Which term describes removing an element from the top of a stack?

What does the top() function do in the context of a stack?

What is the purpose of the empty() function when used with a stack?

What is the correct postfix notation equivalent to the infix notation: a + b * c?

Which data structure is designed to operate in a FIFO (First In, First Out) context?

In a queue, from which end are elements inserted?

What member functions are supported by the Queue class for data insertion and deletion?

What context describes a common application of queues?

Which of the following is an alternative term for the 'push' operation in a queue data structure?

What does the size() function return in the context of a stack?

What is the output of the following code?

stack <int> s;
s.push(10);
s.push(20);
cout << s.top();

What is the output of the following code?

stack <int> s;
s.push(10);
s.push(20);
s.pop();
cout << s.top();

What is the output of the following code?

queue <int> q;
q.push(10);
q.push(20);
cout << q.front();

What is the output of the following code?

queue <int> q;
q.push(10);
q.push(20);
q.pop();
cout << q.front();

In the context of stacks, what is a container adapter?

Which of the following applications uses a stack data structure?

Which mechanism do text editors typically provide that utilizes a stack data structure?

What does the following code do?

void showstack(stack <int> s)
{
    while (!s.empty())
    {
        cout << '\t' << s.top();
        s.pop();
    }
}

What is the main difference between a stack implemented using arrays and a linked stack?

In postfix notation, how is the expression $5 * (7 - (8 / 2 ^ 2) * 3) + 9$ represented?

What happens when you try to pop from an empty stack?

What is the output of the following code?

stack <int> s;
s.push(11);
s.push(101);
s.push(99);
s.push(78);
s.push(25);
s.pop();
s.pop();

What is the output of the following code?

queue <int> q;
q.push(32);
q.push(24);
q.push(56);
q.push(41);
q.push(98);
q.pop();
q.pop();
q.pop();

In a linked queue implementation, if head and tail both point to NULL, what does this indicate?

What is a primary advantage of using a linked queue over an array-based queue?

Regarding postfix notation and using a stack, what is the first step in evaluating an expression?

What happens after an operator is scanned during postfix evaluation?