Western Governors University (WGU) ICSC2100 C949 Data Structures and Algorithms I Practice Exam

In the context of a stack, the operations that can typically be performed are referred to as "push," "pop," and "peek." These operations are fundamental to the stack data structure, which follows the Last In, First Out (LIFO) principle.

- **Push**: This operation adds an element to the top of the stack. When you push an item onto the stack, it becomes the new top element, and any subsequent pop operations will affect this newly added element first.

- **Pop**: This operation removes and returns the top element of the stack. When an item is popped from the stack, it effectively removes the most recently added element, adhering to the LIFO principle.

- **Peek**: This operation allows you to view the top element of the stack without removing it. This is useful for checking the value of the last added item without modifying the stack.

The other options presented involve operations characteristic of different data structures. For instance, enqueue and dequeue are operations associated with a queue, which operates on a First In, First Out (FIFO) basis, while access, modify, and clear relate more generally to collections and do not represent operations specific to the stack. In contrast, the "insert, delete, and