Introduction To Data Structures — Part 1 MCQs with Explanations

Binary search is an efficient algorithm to find an element in a sorted array by repeatedly dividing the search interval in half. The best case time complexity occurs when the target element is found at the very first comparison, which is at the middle of the array. In this best case scenario, the element is located immediately, so only one comparison is needed. Therefore, the best case time complexity of binary search is O(1) , which means constant time. Other cases: - The average and worst case time complexities of binary search are O(log n) , where n is the number of elements in the array. Hence, the correct answer is Option D: O(1) .

Option A: randomly - This means you can go directly to any box (element) in the array by knowing its number (index). Arrays are designed to let you jump straight to an element without looking at the others. Option B: sequentially - This means you'd have to go through each box one after the other to find the one you want. While you *can* access an array sequentially, it's not how they're designed to be used or the most efficient way. Option C: exponentially and Option D: logarithmically - These terms don't really relate to how we access elements in an array. These usually relate to more complex algorithms or how things grow in size. Arrays provide direct access to elements using their index. So, you can get to element number 5 just as quickly as you can get to element number 1. That's why it's called random access.

A stack can be implemented using two queues . In a stack, the Last In First Out (LIFO) principle is followed, while in a queue, the First In First Out (FIFO) principle is used. To implement stack operations using queues, we need two queues — one to hold the elements temporarily and the other to help reverse the order of insertion. When performing a push operation, elements are enqueued in such a way that the newly added element appears at the front of the queue, simulating stack behavior. Alternatively, we can also implement the pop operation by moving elements between the two queues until we reach the desired element to remove. Hence, the minimum number of queues required to implement a stack is 2 .

A way of organizing and storing data is the correct answer to “What is a data structure”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Array is the correct answer to “Which of the following is a linear data structure”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Stack is the correct answer to “Which data structure uses LIFO order”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Queue is the correct answer to “Which data structure uses FIFO order”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

None of the above is the correct answer to “Which of the following is not a data structure”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Stack is the correct answer to “Which data structure is used to implement recursion”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Array is the correct answer to “Which of the following data structures allows random access”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

O(1) is the correct answer to “What is the time complexity of accessing an element in an array”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Queue is the correct answer to “Which data structure is used for breadth-first search (BFS)”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Stack is the correct answer to “Which data structure is used for depth-first search (DFS)”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

A collection of nodes, each pointing to the next node is the correct answer to “What is a linked list”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Insertion at the beginning is the correct answer to “Which of the following operations is faster in a linked list”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Abstract Data Type is the correct answer to “What does ADT stand for”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Graph is the correct answer to “Which of the following is a non-linear data structure”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Dynamic size is the correct answer to “What is the primary advantage of using a linked list over an array”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Stack is the correct answer to “Which data structure is used in a depth-first traversal of a graph”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

LIFO is the correct answer to “What type of data structure is a stack”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Linked List is the correct answer to “Which data structure can be used to implement a queue”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Tree is the correct answer to “In which data structure do elements have a hierarchical relationship”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Faster search is the correct answer to “What is the main advantage of a hash table over a linked list”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Heap is the correct answer to “Which data structure is best for implementing a priority queue”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Push is the correct answer to “What is the primary operation of a stack”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

The last position is connected to the first position is the correct answer to “What is the main characteristic of a circular queue”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Each node has two pointers is the correct answer to “Which of the following is true about a doubly linked list”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Stack is the correct answer to “Which data structure is used to evaluate expressions in postfix form”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

O(n) is the correct answer to “What is the worst-case time complexity of linear search”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Undo mechanism in text editors is the correct answer to “Which of the following is an application of a stack”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Traversal is the correct answer to “What is the term for accessing elements of a data structure in a specific order”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Stack is the correct answer to “Which data structure is used for implementing recursion”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Linked List is the correct answer to “Which of the following data structures is used in implementing LRU cache”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Stack is the correct answer to “Which data structure is most suitable for implementing undo functionality”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Splay Tree is the correct answer to “Which of the following is a self-adjusting data structure”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Queue is the correct answer to “Which data structure is used in a breadth-first traversal of a graph”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Fast random access is the correct answer to “Which of the following is not a characteristic of a linked list”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Slow access to elements by index is the correct answer to “What is the primary disadvantage of a linked list compared to an array”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Heap is the correct answer to “Which data structure is used to implement a priority queue”. This question is standard in competitive examination syllabi for Introduction To Data Structures.

Push is the correct answer to “Which operation is not performed on a queue”. This question is standard in competitive examination syllabi for Introduction To Data Structures.