1. What is the time complexity of inserting an element in a stack of size n?

A. O(n)

B. O(1)

C. O(log n)

D. O(n^2)

Answer: B. O(1)

Explanation: When you insert an element into a stack, you simply push it onto the top of the stack. This operation takes constant time, regardless of the size of the stack, so the time complexity is O(1).

2. What is the main advantage of using a linked list over an array?

A. Constant time access to elements

B. Lower memory usage

C. Dynamic size

D. Faster traversal

Answer: C. Dynamic size

Explanation: One of the key advantages of a linked list is that its size can change dynamically, which means you can add or remove elements as needed. Arrays, on the other hand, have a fixed size and require you to allocate memory for the maximum number of elements you might need, even if you don't actually use all of that memory.

3. Which data structure uses First In First Out (FIFO) ordering?

A. Stack

B. Queue

C. Tree

D. Graph

Answer: B. Queue

Explanation: A queue is a data structure that uses the First In First Out (FIFO) ordering, which means that the first element added to the queue is the first one to be removed. Stacks, on the other hand, use Last In First Out (LIFO) ordering, which means that the last element added to the stack is the first one to be removed.

4. What is the time complexity of searching for an element in a binary search tree of size n?

A. O(1)

B. O(log n)

C. O(n)

D. O(n^2)

Answer: B. O(log n)

Explanation: In a binary search tree, each node has at most two children, and the left subtree of a node contains only elements that are smaller than the node's value, while the right subtree contains only elements that are larger. This property allows you to search for an element in O(log n) time by recursively traversing the tree and comparing the element with the values in each node.

5. Which data structure uses key-value pairs?

A. Stack

B. Queue

C. Array

D. Map

Answer: D. Map

Explanation: A map is a data structure that uses key-value pairs to store and retrieve data. Each key in the map is associated with a value, which can be any type of data. Stacks and queues are simple data structures that store only a single type of data, while arrays can store multiple types of data but don't use key-value pairs.

6. Which data structure is best suited for implementing a LIFO (Last In First Out) system?

A. Queue

B. Stack

C. Linked List

D. Tree

Answer: B. Stack

Explanation: A stack is a data structure that is best suited for implementing a LIFO (Last In First Out) system. This is because the most recently added element is always the first to be removed, just like in a stack of plates. Queues, on the other hand, are best suited for implementing a FIFO (First In First Out) system.

7. What is the time complexity of inserting an element at the beginning of a linked list of size n?

A. O(n)

B. O(log n)

C. O(1)

D. O(n^2)

Answer: C. O(1)

Explanation: When you insert an element at the beginning of a linked list, you simply create a new node and set its next pointer to the current head of the list. This operation takes constant time, regardless of the size of the list, so the time complexity is O(1).

8. Which data structure is used in depth-first search algorithm?

A. Stack

B. Queue

C. Linked List

D. Tree

Answer: A. Stack

Explanation: Depth-first search is an algorithm that traverses a graph or tree by exploring as far as possible along each branch before backtracking. This can be implemented using a stack to keep track of the nodes to be visited, with each new node added to the top of the stack.

9. What is the time complexity of merging two sorted arrays of size m and n?

A. O(m + n)

B. O(log(m + n))

C. O(m * n)

D. O(m^2 + n^2)

Answer: A. O(m + n)

Explanation: When merging two sorted arrays, you compare the elements in each array one by one and add the smaller element to the new array until all the elements have been added. Since each element is only compared once, the time complexity is O(m + n).

10. Which data structure is used in breadth-first search algorithm?

A. Stack

B. Queue

C. Linked List

D. Tree

Answer: B. Queue

Explanation: Breadth-first search is an algorithm that traverses a graph or tree by exploring all the nodes at a given depth before moving on to the next level. This can be implemented using a queue to keep track of the nodes to be visited, with each new node added to the end of the queue.

11. Which data structure is used to implement a hash table?

A. Stack

B. Queue

C. Linked List

D. Array

Answer: D. Array

Explanation: A hash table is a data structure that maps keys to values using a hash function. The keys are hashed to an index in an array, and the corresponding value is stored in that index. Arrays are used to implement the hash table because they provide constant-time access to individual elements.

12. What is the time complexity of finding the maximum element in a binary heap of size n?

A. O(1)

B. O(log n)

C. O(n)

D. O(n^2)

Answer: A. O(1)

Explanation: A binary heap is a tree-based data structure in which each node has a value that is greater than or equal to the values of its children (in a max heap). The maximum element is always stored at the root of the tree, so finding it takes constant time, regardless of the size of the heap.

13. Which data structure is best suited for implementing a priority queue?

A. Stack

B. Queue

C. Linked List

D. Heap

Answer: D. Heap

Explanation: A priority queue is a data structure that stores elements with associated priorities and retrieves them in order of priority. A heap is a binary tree-based data structure that is commonly used to implement a priority queue because it allows for constant-time access to the element with the highest priority.

14. What is the time complexity of searching for an element in a hash table?

A. O(1)

B. O(log n)

C. O(n)

D. O(n^2)

Answer: A. O(1)

Explanation: In a hash table, the key is hashed to an index in an array, and the corresponding value is stored in that index. Since the hashing function provides a constant-time way to access the index, searching for an element in a hash table takes O(1) time on average.

15. Which data structure is used in Dijkstra's algorithm?

A. Stack

B. Queue

C. Linked List

D. Heap

Answer: D. Heap

Explanation: Dijkstra's algorithm is a shortest path algorithm that finds the shortest path between two nodes in a graph. It can be implemented using a priority queue (often a heap) to keep track of the nodes to be visited, with each node added to the queue with a priority based on its distance from the starting node.

16. What is the time complexity of inserting an element into a binary search tree of size n?

A. O(1)

B. O(log n)

C. O(n)

D. O(n^2)

Answer: B. O(log n)

Explanation: In a binary search tree, elements are stored in a way that allows for efficient search, insert, and delete operations. When inserting an element into a binary search tree, you compare it to the values of the nodes in the tree and insert it in the appropriate location based on its value. Since the height of the tree is log n on average, the time complexity of inserting an element into a binary search tree is O(log n).

17. Which data structure is used in the merge sort algorithm?

A. Stack

B. Queue

C. Linked List

D. Array

Answer: D. Array

Explanation: Merge sort is a sorting algorithm that divides an array into two halves, sorts each half recursively, and then merges the two halves together to produce a sorted array. Arrays are used to store the elements of the input and output arrays.

18. What is the time complexity of searching for an element in a binary search tree of size n?

A. O(1)

B. O(log n)

C. O(n)

D. O(n^2)

Answer: B. O(log n)

Explanation: In a binary search tree, elements are stored in a way that allows for efficient search, insert, and delete operations. When searching for an element in a binary search tree, you compare it to the values of the nodes in the tree and recursively search the left or right subtree depending on its value. Since the height of the tree is log n on average, the time complexity of searching for an element in a binary search tree is O(log n).

19. Which data structure is used in the quick sort algorithm?

A. Stack

B. Queue

C. Linked List

D. Array

Answer: A. Stack

Explanation: Quick sort is a sorting algorithm that selects a pivot element and partitions the input array into two subarrays, one containing elements less than the pivot and the other containing elements greater than the pivot. It then sorts the subarrays recursively. A stack is used to keep track of the subarrays to be sorted.

20. What is the time complexity of deleting an element from a binary search tree of size n?

A. O(1)

B. O(log n)

C. O(n)

D. O(n^2)

Answer: B. O(log n)

Explanation: In a binary search tree, elements are stored in a way that allows for efficient search, insert, and delete operations. When deleting an element from a binary search tree, you search for the element and then remove it by either replacing it with its in-order predecessor or successor or by simply removing it if it has no children. Since the height of the tree is log n on average, the time complexity of deleting an element from a binary search tree is O(log n).

21. What is the time complexity of inserting an element into a hash table of size n?

A. O(1)

B. O(log n)

C. O(n)

D. O(n^2)

Answer: A. O(1)

Explanation: In a hash table, the key is hashed to an index in an array, and the corresponding value is stored in that index. Since the hashing function provides a constant-time way to access the index, inserting an element into a hash table takes O(1) time on average.

22. Which data structure is used in the breadth-first search algorithm?

A. Stack

B. Queue

C. Linked List

D. Heap

Answer: B. Queue

Explanation: Breadth-first search is a graph traversal algorithm that explores all the vertices at a given level before moving on to the next level. A queue is used to keep track of the vertices to be visited, with each vertex added to the queue as it is discovered.

We hope that you must have found this exercise quite useful. If you wish to join Data Structure, C++, Android, Core PHP, Laravel Framework, Core Java, Advance Java, Spring Boot Framework, Struts Framework training, feel free to contact us at +91-9936804420 or email us at aditya.inspiron@gmail.com. 

Happy Learning 

Team Inspiron Technologies