InterviewSolution
Saved Bookmarks
InterviewSolution
This section includes InterviewSolutions, each offering curated multiple-choice questions to sharpen your knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which among the following data structures is best suited for storing very large numbers (numbers that cannot be stored in long long int). Following are the operations needed for these large numbers.(A) Array(B) Linked List(C) Binary Tree(D) Hash |
| Answer» | |
| 2. |
Which data structure is used for balancing of symbols?(A) Stack(B) Queue(C) Tree(D) Graph |
| Answer» | |
| 3. |
Which data structure is best suited for converting recursive implementation to iterative implementation of an algorithm?(A) Queue(B) Stack(C) Tree(D) Graph |
| Answer» | |
| 4. |
Consider a situation where a client receives packets from a server. There may be differences in speed of the client and the server. Which data structure is best suited for synchronization?(A) Circular Linked List(B) Queue(C) Stack(D) Priority Queue |
| Answer» | |
| 5. |
Which of the following data structures is best suited for efficient implementation of priority queue?(A) Array(B) Linked List(C) Heap(D) Stack |
| Answer» | |
| 6. |
A data structure is required for storing a set of integers such that each of the following operations can be done in (log n) time, where n is the number of elements in the set. o Delection of the smallest element o Insertion of an element if it is not already present in the setWhich of the following data structures can be used for this purpose?(A) A heap can be used but not a balanced binary search tree(B) A balanced binary search tree can be used but not a heap(C) Both balanced binary search tree and heap can be used(D) Neither balanced binary search tree nor heap can be used |
| Answer» | |