Stacks

Answer: c) A data structure that allows elements to be inserted and removed from one end only

Explanation: A stack is a data structure that follows the Last-In-First-Out (LIFO) principle, meaning that the element that is inserted last will be the first to be removed. It allows elements to be inserted and removed from the top end only.

Answer: a) Push and pop

Explanation: The two primary operations on a stack are push, which adds an element to the top of the stack, and pop, which removes the top element from the stack.

Answer: b) Linked list

Explanation: A linked list is commonly used to implement a stack since it allows for efficient insertion and deletion at the beginning of the list.

Answer: b) An error occurs

Explanation: Popping an element from an empty stack is considered an error since there is no element to remove.

Answer: d) Storing data in a database

Explanation: While a stack can be used to store data temporarily in memory, it is not commonly used to store data in a database.

Answer: a) O(1)

Explanation: The push and pop operations on a stack implemented using an array have a time complexity of O(1), since they simply involve adding or removing an element from the end of the array.

Answer: d) It allows for efficient insertion and deletion at the top end

Explanation: The primary advantage of using a stack is that it allows for efficient insertion and deletion at the top end, making it useful for applications that require temporary storage of data.

Answer: c) Evaluating arithmetic expressions

Explanation: A stack can be used to evaluate arithmetic expressions in postfix notation, which involves pushing operands onto the stack and popping operators from the stack when they are encountered.

Answer: d) It can lead to stack overflow errors if the stack becomes too large

Explanation: One potential disadvantage of using a stack is that it can lead to stack overflow errors if the stack becomes too large and exceeds the available memory.

Answer: a) Checking if a sentence is a palindrome

Explanation: A stack can be used to check if a sentence is a palindrome by pushing the first half of the sentence onto the stack and then comparing the remaining half to the elements popped from the stack.