CodeSignal Technical Assessment Coding Fundamentals 2

Question 1

What is the time complexity of accessing an element by index in a dynamic array (like Python's list)?

Accepted Answer

O(1)

Answer

O(log n)

Answer

O(n)

Answer

O(n²)

Question 2

Which of the following correctly describes a stack data structure?

Accepted Answer

Last-In, First-Out (LIFO)

Answer

First-In, First-Out (FIFO)

Answer

Random access by index

Answer

Sorted order by value

Question 3

Given the code snippet `x = [1, 2, 3]; y = x; y.append(4)`, what is the value of `x`?

Accepted Answer

[1, 2, 3, 4]

Answer

[1, 2, 3]

Answer

[4, 1, 2, 3]

Answer

Error

Question 4

What does a hash function guarantee when used in a hash table?

Accepted Answer

O(1) average-case lookup

Answer

Sorted output

Answer

Unique keys only

Answer

No collisions

Question 5

In Python, what is the result of `bool([])` and `bool([0])`?

Accepted Answer

False, True

Answer

False, False

Answer

True, False

Answer

True, True

Question 6

Which sorting algorithm has the best worst-case time complexity?

Accepted Answer

Merge Sort

Answer

Quick Sort

Answer

Bubble Sort

Answer

Insertion Sort

Question 7

What is the output of `print(3 // 2)` in Python 3?

Accepted Answer

1

Answer

1.5

Answer

2

Answer

0