Mastering Data Structures

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

• O(log n)

• O(1)

• O(n^2)

• O(n)

How do you insert a new node at the beginning of a linked list?

• Create a new node and insert it in the middle of the list.

• Add the new node at the end of the list and adjust the tail pointer.

• Remove the current head and set the new node as the head.

• Create a new node, set its next to the current head, and update the head to the new node.

What is the main difference between a stack and a queue?

• The main difference is that a stack uses LIFO while a queue uses FIFO.

• A stack uses FIFO while a queue uses LIFO.

• Both stack and queue use the same data structure.

• A stack allows random access while a queue does not.

Describe how a stack can be implemented using an array.

• A stack can be implemented using a linked list with nodes pointing to each other.

• A stack can be implemented using a queue to store elements in a first-in-first-out manner.

• A stack can be implemented using a hash table to store key-value pairs for elements.

• A stack can be implemented using an array by using an array to store elements and an index to track the top of the stack.

What is the purpose of a queue in data structures?

• The purpose of a queue is to delete elements in a LIFO manner.

• A queue is used to store elements randomly without any order.

• The purpose of a queue is to manage and process elements in a sequential order, following the FIFO principle.

• A queue is designed to sort elements based on their priority level.

Explain the concept of a circular queue.

• A circular queue is a data structure that only allows insertion at the front.

• A circular queue is a type of stack that uses a circular linked list.

• A circular queue is a fixed-size array that does not allow wrap-around.

• A circular queue is a linear data structure that connects the end of the queue back to the front, allowing for efficient space utilization.

What is the worst-case time complexity of bubble sort?

• O(n)

• O(log n)

• O(n log n)

• O(n^2)

How does quicksort work and what is its average time complexity?

• O(n)

• O(n^2)

• O(n log n)

• O(log n)

What is the difference between linear search and binary search?

• Linear search is O(log n), while binary search is O(n).

• Linear search is O(n) in time complexity, while binary search is O(log n).

• Binary search can be used on unsorted data, while linear search cannot.

• Linear search is faster than binary search in all cases.

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

• O(1)

• O(n log n)

• O(n)

• O(log n)