Data Structures Quiz

What is the time complexity for accessing an element in an array?

• O(1)

• O(log n)

• O(n^2)

• O(n)

What is the time complexity for searching an element in a queue?

• O(log n)

• O(n)

• O(1)

• O(n^2)

What is the time complexity for inserting an element at the end of a dynamic array?

• O(log n)

• O(n^2)

• O(1)

• O(n)

What is the time complexity for deleting an element from the middle of an array?

• O(1)

• O(n)

• O(n^2)

• O(log n)

What is the time complexity for searching an element in a stack?

• O(n)

• O(n^2)

• O(1)

• O(log n)

What is the average time complexity for searching in a balanced binary search tree?

• O(n)

• O(n^2)

• O(1)

• O(log n)

What is the time complexity for adding an edge in an adjacency list representation of a graph?

• O(log n)

• O(n^2)

• O(1)

• O(n)

What is the time complexity for removing an edge in an adjacency matrix representation of a graph?

• O(n^2)

• O(log n)

• O(n)

• O(1)

What is the time complexity for accessing an element in a linked list?

• O(n^2)

• O(n)

• O(1)

• O(log n)

What is the time complexity for inserting an element at the head of a linked list?

• O(1)

• O(n)

• O(n^2)

• O(log n)