Stacks

What is the principle that a stack data structure follows?

• Last In Last Out (LILO)

• First In Last Out (FILO)

• Last In First Out (LIFO)

• First In First Out (FIFO)

Which operation is used to add an element to a stack?

• Pop

• Add

• Insert

• Push

What is the term for the end of the stack from which elements are removed?

• Top of stack

• Bottom of stack

• Inactive end

• Active end

Which of the following is NOT an application of stacks?

• Heap memory management

• Managing data in recursion

• Sorting algorithms

• Simulation of people entering a lift

In stack implementation using arrays, what does 'top' represent?

• The current location of the top element

• The bottom of the stack

• The number of elements in the stack

• The maximum size of the stack

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

• The stack becomes full

• The top remains unchanged

• An error occurs

• The stack overflows

What is the output of the following postfix expression: 'abc*+d-'?

• a*b+c-d

• b*(c+a)-d

• a+(b*c)-d

• ((b*c)+a)-d

Which of the following is a characteristic of tail recursion?

• The recursive call is the first action

• It cannot be optimized

• It does not use a stack

• The recursive call is the last action

What is the purpose of the PUSH operation in a stack?

• To remove an element

• To retrieve the top element

• To add an element

• To check if the stack is empty

In the context of stacks, what does ADT stand for?

• Algorithmic Data Type

• Advanced Data Technique

• Abstract Data Type

• Applied Data Theory