Topic 3: Stacks

What is the principle that a stack data structure follows?

• Last Come Last Served (LCLS)

• Last In First Out (LIFO)

• First In First Out (FIFO)

• First Come First Served (FCFS)

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

• Insert

• Push

• Add

• Pop

What is the term for the end of the stack where elements are added or removed?

• Top of stack

• End of stack

• Middle of stack

• Bottom of stack

Which of the following is NOT an application of stacks?

• Managing data in recursion

• Heap memory management

• Sorting algorithms

• Simulation of people entering a lift

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

• The maximum size of the stack

• The current location of the last element

• The first element in the stack

• The total number of elements in the stack

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

• It returns null

• It does nothing

• It throws an error

• It returns the last element

What is the output of the following operation: PUSH(5) on an empty stack?

• 5

• Stack is empty

• Stack is full

• Error

Which of the following algorithms is used to implement the push operation?

• CREATE(STACK)

• PUSH(STACK, ITEM)

• CHK_STACK_EMPTY(STACK)

• POP(STACK, ITEM)

What is the result of evaluating the postfix expression 'ab+c*'?

• a + b + c

• a * (b + c)

• a + b * c

• a * b + c

Which data structure can be used to implement a stack?

• Arrays

• Graphs

• Trees

• Hash tables