Data Structure Operations Time Complexities

What is the relative time complexity (Big O value) for access within an array that contains n elements?

• O(1)

• O(log n)

• O(n)

• O(n log n)

What is the relative time complexity (Big O value) for searching within an array that contains n elements?

• O(1)

• O(log n)

• O(n)

• O(n log n)

What is the relative time complexity (Big O value) for access within a Stack that contains n elements?

• O(1)

• O(log n)

• O(n)

• O(n log n)

What is the relative time complexity (Big O value) for searching within a Stack that contains n elements?

• O(1)

• O(log n)

• O(n)

• O(n log n)

What is the relative time complexity (Big O value) for insertion within a Stack that contains n elements?

• O(1)

• O(log n)

• O(n)

• O(n log n)

What is the relative time complexity (Big O value) for deletion within a Stack that contains n elements?

• O(1)

• O(log n)

• O(n)

• O(n log n)

What is the relative time complexity (Big O value) for access within a Queue that contains n elements?

• O(1)

• O(log n)

• O(n)

• O(n log n)

What is the relative time complexity (Big O value) for searching within a Queue that contains n elements?

• O(1)

• O(log n)

• O(n)

• O(n log n)

What is the relative time complexity (Big O value) for insertion within a Queue that contains n elements?

• O(1)

• O(log n)

• O(n)

• O(n log n)

What is the relative time complexity (Big O value) for deletion within a Queue that contains n elements?

• O(1)

• O(log n)

• O(n)

• O(n log n)