Arrays and Linked Lists - Python Implementations for Exams

Arrays and Linked Lists - Implementations in Python - Numerical Applications

Q. In a stack implemented using an array, what is the time complexity of the push operation?

Solution

The push operation in a stack implemented with an array is O(1) as it adds an element to the top of the stack.

Correct Answer: A — O(1)

Q. In Python, which data structure can be used to implement a stack?

Solution

A stack can be implemented using a list in Python, utilizing append() and pop() methods.

Correct Answer: A — List

Q. Which of the following is a valid way to append an element to a linked list in Python?

Solution

In Python, a linked list typically has an append method defined, so linked_list.append(value) is correct.

Correct Answer: C — linked_list.append(value)

Showing 1 to 3 of 3 (1 Pages)