Which of the following Python data structures can be used to implement a stack efficiently?

Question

BlackTom AI · Accepted Answer

The question asks which Python data structure can be used to implement a stack efficiently.
Option 1: Tuple. Tuples are immutable, which means you cannot efficiently push or pop elements to simulate a stack; every modification would require creating a new tuple.
Option 2: None of the above. Since Python provides a standard mutable structure that supports stack operations efficiently, this option is not accurate.
Option 3: Set. Sets are unordered collections without a reliable index or order, so they cannot support a LIFO (last-in, first-out) access pattern that a stack requires.
Option 4: Dictionary. Dictionaries store key-value pairs and are not designed to provide a linear, indexable sequence with efficient push/pop semantics at one end, so they are not a natural stack implementation.
Option 5: String. Strings are immutable sequences of characters; modifying a string to push or pop would be expensive and not suitable for a stack.
Option 6: List. Lists in Python are dynamic arrays that offer O(1) amortized time for appending and popping from the end, which aligns perfectly with stack semantics (push and pop operations). This makes lists a standard and efficient choice for implementing a stack.

IS 4485-001 Fall 2025 Final Exam

Which of the following Python data structures can be used to implement a stack efficiently?

查看解析

登录即可查看完整答案

类似问题

Which of the following is LIFO (Last In First Out)?

Which of the following best describes what a "stack" is?

What is the result of performing the following stack operations starting with an empty stack: push(1), push(2), pop(), push(3), peek()?

What will this code print?

Stacks_2 See the Stack ADT implemented using a Python's List, this ADT was discussed in lectures. The pop method's amortized run time complexity is O(____).

更多留学生实用工具

考试浏览器助手

风格化写作助手

论文查重助手

文献引用助手

课堂转译助手

课堂笔记助手

Quiz搜索助手

学校历年真题

智能刷题助手

智能匹配练习

希望你的学习变得更简单