In a stack, where can elements be added or removed?*1 pointa. Only at the topb. Only at the bottomc. At both the top and bottomd. Anywhere in the stack

Question 1 1 Point A stack follows the principle of: Last-in, First-out (LIFO) First-in, First-out (FIFO) Random In, Random Out (RIRU) None of the above Question 2 1 Point How can you add an element to a stack? Insert it anywhere Insert it at the bottom Insert it at the top You cannot add elements to a stack Question 3 1 Point How can you remove an element from a stack? Remove it anywhere Remove the bottom element Remove the top element You cannot remove elements from a stack Question 4 1 Point What is the name for the top element in a stack? Base element Top element Current element Head element Question 5 1 Point What real-world object is similar to a stack? A conveyor belt A stack of plates A bucket of water A branching pipe Question 6 1 Point Stacks are considered: A complex data structure A fundamental data structure An obsolete data structure Rarely used in applications Question 7 1 Point You can access any element in a stack at any time. True False Question 8 1 Point Stacks are used in web browsers to store visited websites. True False Question 9 1 Point Text editors use stacks to implement the "undo" functionality. True False Question 10 1 Point A newly created stack is always full. True False

If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, in what order will they be removed?

True or False: In a stack implemented using an array, the size of the stack is fixed, andelements can only be added or removed from the top of the stack.

.If the elements “B”, “O”, “M” and “B” are placed in a stack and are deleted one at a time, what is the order of removal?a) BOMB b) BMOB c) MBBO d) BBOM

Which of the following is not an operation on a stack?