Data Structures

Which principle does a stack follow regarding the order of operations?

• Last In, Last Out (LILO)
• First In, Last Out (FILO)
• Last In, First Out (LIFO)
• First In, First Out (FIFO)

What are the two primary operations of a stack?

• Add and Remove
• Top and Bottom
• Push and Pop
• Insert and Delete

Which of the following describes how stacks can be implemented?

• Only using linked lists
• Using arrays or linked lists
• Only using arrays
• Using trees or graphs

Translate this question to English language

• Creating user interfaces

• Storing large datasets for analysis

• Managing function calls in programming

• Sorting data in ascending order

How do applications typically use stacks for undo operations?

• By removing the oldest action first
• By pushing each action onto the stack and popping the last action for undo
• By storing actions in a queue
• By executing actions in reverse order

Which of the following statements about queues is true?

• Queues are not used in real-world applications.
• Queues operate on a first-in, first-out basis.
• Queues can only be implemented using linked lists.
• Queues can only store integer values.

What is the primary characteristic of a queue in computer science?

• It operates on a last-in, first-out (LIFO) basis.
• It operates on a first-in, first-out (FIFO) basis.
• It allows random access to elements.
• It is a static data structure.

What does the Peek operation do in a queue?

• Checks if the queue is empty
• Adds an element to the rear
• Removes an element from the front
• Returns the front element without removing it

What operation adds an element to the rear of a queue?

• IsEmpty
• Peek
• Enqueue
• Dequeue

Which operation is used to remove an element from the front of a queue?

• IsEmpty
• Peek
• Dequeue
• Enqueue