Which data structure operates on a Last-In, First-Out (LIFO) access principle?
Answer and explanation
Correct answer: D. Stack
- Step 1: A Stack allows insertion (push) and deletion (pop) exclusively at one end called the top.
- Step 2: The element added most recently is the first one removed, defining the LIFO principle.
Answer
Stack.
Why not the others: 'Queue' operates on First-In, First-Out (FIFO); 'Linked List' allows insertion/deletion at any node; 'Binary Heap' prioritizes elements by key priority.
Practise more Python Programming, Data Structures, Algorithms, Networks and Cybersecurity.
Free questions with an explanation for every one, and full timed Saudi Secondary School Certificate mock tests.
More Python Programming, Data Structures, Algorithms, Networks and Cybersecurity questions
- What is the time complexity of searching for an element in an unsorted array of elements using linear search?
- What is the output of the following Python expression: `[x**2 for x in range(5) if x % 2 == 1]`?
- Which SQL clause is used to filter aggregated group records after a `GROUP BY` statement has been applied?
- What type of network topology connects all nodes to a central forwarding device such as a network switch?
- In cybersecurity, what type of malicious attack overwhelms a web server with massive volumes of traffic from multiple compromised sources to…
- What is the binary representation of the decimal integer 25?