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

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

1. What does LIFO stand for in the context of stacks?a. Last-In, First-Outb. First-In, First-Outc. Last-Out, First-Ind. First-Out, Last-In2. Which of the following is a fundamental stack operation?a. Insertb. Removec. Pushd. Shift3. In stack operations, what is the primary check performed before pushing an element onto thestack?a. Check if the stack is emptyb. Check if the stack is fullc. Check if the stack is halfway fulld. Check if the element is greater than the top element4. What error condition is triggered when you attempt to push an element onto a full stack?a. Stack Overflowb. Stack Underflowc. Invalid Operationd. Stack Limit Exceeded5. When you pop an element from a stack, which item is removed?a. The last item addedb. The first item addedc. The item at the middle of the stackd. The item at the bottom of the stackStacks: Linked List Implementation6. In a linked list-based stack, which element is removed when you pop an element?a. The first element addedb. The last element addedc. The element at the middle of the stackd. The element at the bottom of the stack7. What is the key advantage of a linked list-based stack over an array-based stack?a. Constant-time access to elementsb. Fixed size and memory efficiencyc. Dynamic sizing and flexibilityd. Faster push operation8. In the linked list-based stack, which operation adds an element to the stack?a. Insertb. Pushc. Add

Question 12 1 Point A queue follows the principle of: Last-in, First-out (LIFO) First-in, First-out (FIFO) Random In, Random Out (RIRU) None of the above Question 13 1 Point How can you add an element to a queue? Insert it anywhere Insert it at the beginning Insert it at the end (back) You cannot add elements to a queue Question 14 1 Point How can you remove an element from a queue? Remove it anywhere Remove the last element added Remove the first element added (front) You cannot remove elements from a queue Question 15 1 Point What is the name for the first element that can be removed from a queue? Top element First element Current element Head element Question 16 1 Point What real-world scenario is similar to a queue? A stack of plates A branching pipe A waiting line at a store A conveyor belt moving in a circle Question 17 1 Point Queues are considered: A complex data structure A fundamental data structure An obsolete data structure Rarely used in applications Question 18 1 Point You can access any element in a queue at any time. True False Question 19 1 Point Queues are used in computer networks to handle incoming data packets. True False Question 20 1 Point Reservation centers use queues to manage customer requests. True False Question 21 1 Point A newly created queue is always full. True False

The book describes the Stack as having a LIFO (Last-In, First-Out) property. Briefly (in one sentence) explain what this property means with respect to items in the Stack data structure.

What does LIFO stand for in the context of stacks?*1 pointa. Last-In, First-Outb. First-In, First-Outc. Last-Out, First-Ind. First-Out, Last-In