Python Data Structures and Algorithms Quiz

What is the time complexity of appending an element to a list in Python?

• O(1)

• O(log n)

• O(n)

• O(n²)

What will be the output of the following code? def mystery_function(arr): return [x**2 for x in arr if x % 2 == 0] print(mystery_function([1, 2, 3, 4, 5]))

• [1, 4, 9, 16, 25]

• [4, 16]

• [2, 4]

• None

What is the space complexity of a recursive function?

• O(1)

• O(n)

• O(n log n)

• O(log n)

Which data structure follows First In, First Out (FIFO)?

• Stack

• Queue

• Array

• Linked List

What is the output of the following code? def find_duplicates(arr): return len(arr) != len(set(arr)) print(find_duplicates([1, 2, 3, 4, 1]))

• True

• False

• [1, 2, 3, 4]

• [1]

Which of the following is true for a binary search?

• The list must be unsorted

• The list must be sorted

• The list can be unsorted or sorted

• The list can only contain negative integers

What is the space complexity of merging two sorted arrays of size n?

• O(1)

• O(n)

• O(2n)

• O(log n)

What will be the output of the following Python code? def reverse_string(s): return ''.join(reversed(s)) print(reverse_string("hello"))

• olleh

• hello

• ehllo

• None

What is the time complexity of searching an element in a balanced binary search tree?

• O(1)

• O(n)

• O(log n)

• O(n²)

What does the following Python code do? def remove_duplicates(lst): return list(set(lst)) print(remove_duplicates([1, 2, 2, 3, 4, 4, 5]))

• Removes duplicates and returns a sorted list

• Removes duplicates but does not guarantee order

• Returns a list with only unique elements in sorted order

• Removes duplicates and maintains order of elements