Basic Stack Operations Quiz

Stack Operations and Characteristics

• An empty stack is initialized using the operation new Stack().
• After performing push(10), push(5), and push(15) on an empty stack, the current size of the stack is three.
• The pop() operation removes and returns the top element from the stack.
• The operation used to view the top element without removing it is typically called peek.
• The remove methods inherited from Vector should not be used in stack implementations due to potential disruption of stack behavior, violating LIFO principles.
• The method that returns an iterator over stack items is iterator(), and its remove() method is not supported as it could invalidate the stack structure.
• The clear() method in a StackADT implementation removes all elements from the stack.
• The search method in StackADT typically returns a one-based index, differing from zero-based positioning used in many programming languages.
• A fundamental requirement of a StackADT is supporting operations that adhere to the Last In, First Out (LIFO) principle.
• The operation supported by StackADT to add an element is push().
• A key capability of a StackADT related to element access is the ability to inspect the top element via peek.
• The operation used to add an element to the top of a stack is push.
• The purpose of the 'peek' operation is to retrieve the top element without modifying the stack.
• Stack applications in interpreters, such as the Java Virtual Machine, involve managing function calls and local variables.
• In parsing processes, compilers use stacks to ensure the proper order of operations and syntax rules.
• Backtrackers utilize stacks for managing undo and redo operations by storing previous states.
• Each time a method is called in the call stack, a new frame is created with local variables and control information.
• The main() method is situated at the bottom of the call stack.
• Upon method completion, control is returned to the invoking method, typically with a return value.

Queue Operations and Characteristics

• In a queue, elements are added at the rear and removed from the front.
• The length of an empty queue is zero.
• A queue represents a First In, First Out (FIFO) sequence.
• The key characteristic of a queue is the orderly processing of elements in the order they were added.
• The length of a queue is defined as the count of elements currently in it.
• A fundamental requirement of a QueueADT is to maintain the FIFO principle.
• The operation supported by a QueueADT to add an element at the end is enqueue().
• In a QueueADT, it should be possible to view the first element using peek() without removing it.
• Post the dequeue() operation, the queue will have one less element than before.
• The result of peek() after dequeue() reflects the next element in the queue.
• A common application requiring order preservation is task scheduling.
• Web servers maintain a queue of HTTP requests to manage incoming traffic.
• Event-driven applications employ queues to manage objects and events for processing.
• Print job management systems maintain a queue of print tasks to ensure order.
• Applications like keyboard input processing maintain queues to manage key presses.
• The iterator returned from iterator() in a QueueADT implementation does not support the remove() method.
• To check if a queue is full in a QueueADT implementation, a method like isFull() is used.
• The method used to remove all elements from a queue in a QueueADT implementation is clear().
• A method that returns an array of all items in a queue is typically toArray().
• The remove() method is not supported for the iterator over queue items in a QueueADT.
• In a fixed-size queue implementation, a method like isFull() is also employed to check capacity.

Test your knowledge of basic stack operations with this quiz. Answer questions about stack initialization, size after pushing elements, and the effects of pop() operation. See how well you understand the fundamental concepts of stacks.