COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
It is consider an inventory of 1 million(106) items of a store. If the application is to search an item, it has to search an item in 1 million(106) items every time slowing down the search
|
|
Algorithm
|
|
|
Data Search
|
|
|
Data Structure
|
|
|
Data manipulation
|
Explanation:
Detailed explanation-1: -Which data structure is most efficient to find the top 10 largest items out of 1 million items stored in file? Explanation: Min heap of size 10 is sufficient to find the top 10 largest items.
Detailed explanation-2: -Correct Answer Max Heap is considered the best data structure to find the maximum value in a given set of data.
Detailed explanation-3: -Expert-Verified Answer. Explanation: A binary search tree, additionally referred to as an ordered binary tree is a binary tree in which the nodes are organized in order.
Detailed explanation-4: -Answer: Suffix Tree is most suitable data structure for searching thousands of different small strings in a fixed text efficiently.
There is 1 question to complete.