MCQs | eBooks – Textbook Solutions All types eBook are available
A. Binary Search Tree B. Segment Tree C. Queue D. Stack AnswerOption: B
Read More »Data Structures
|
What is a “trie” data structure primarily used for?
A. Storing and searching binary numbers B. Implementing LIFO order C. Efficiently storing and searching strings D. Implementing FIFO order AnswerOption: B
Read More »Which type of balanced binary search tree guarantees O(log n) time complexity for insertions, deletions, and lookups?
A. Binary Heap B. AVL Tree C. Skip List D. Unbalanced Binary Search Tree AnswerOption: B
Read More »What is the primary purpose of a B-tree in database systems?
A. To store unstructured data B. To minimize disk I/O operations for large data sets C. To implement recursion D. To perform complex calculations AnswerOption: B
Read More »Which data structure allows O(1) time complexity for both insertions and deletions of the maximum element?
A. Max-Heap B. Binary Search Tree C. Hash Table D. Linked List AnswerOption: A
Read More »What is the time complexity of inserting an element in a balanced binary search tree (AVL or Red-Black Tree)?
A. O(1) B. O(n) C. O(log n) D. O(n^2) AnswerOption: C
Read More »Which data structure is most suitable for implementing a LRU (Least Recently Used) cache?
A. Stack B. Queue C. Linked List with Hash Map D. Array AnswerOption: C
Read More »In a binary search tree, what is the time complexity of searching for an element in the worst case?
A. O(1) B. O(n) C. O(log n) D. O(n log n) AnswerOption: B
Read More »What is the primary benefit of using a hash table for data storage and retrieval?
A. Faster insertion and deletion B. O(1) average time complexity for search operations C. Ability to handle sorted data D. Easy implementation AnswerOption: B
Read More »Which of the following data structures is best for implementing graph algorithms like Dijkstra’s and Prim’s?
A. Adjacency Matrix B. Adjacency List C. Incidence Matrix D. Linked List AnswerOption: B
Read More »Which traversal technique in a binary tree visits the root node first, then the left subtree, and finally the right subtree?
A. Inorder B. Preorder C. Postorder D. Level Order AnswerOption: B
Read More »What is the time complexity of inserting an element at the beginning of a singly linked list?
A. O(1) B. O(n) C. O(log n) D. O(n^2) AnswerOption: A
Read More »Which of the following data structures is commonly used to implement an undo feature in software applications?
A. Queue B. Stack C. Array D. Binary Search Tree AnswerOption: B
Read More »What is the primary advantage of a doubly linked list over a singly linked list?
A. Faster traversal in one direction B. Ability to traverse in both directions C. Lower memory usage D. Simpler implementation AnswerOption: B
Read More »Which data structure is best suited for implementing a priority queue?
A. Stack B. Hash Table C. Heap D. Linked List AnswerOption: C
Read More »