Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...


Which of the following data structures is on average the
fastest for retrieving data:




1) Binary Tree


2) Hash Table


3) Stack

Answers were Sorted based on User's Feedback



Which of the following data structures is on average the fastest for retrieving data: 1)..

Answer / shruti

hash table

Is This Answer Correct ?    26 Yes 4 No

Which of the following data structures is on average the fastest for retrieving data: 1)..

Answer / jbo5112

It depends on what you're looking for. If you want to find
what you just inserted, then a stack would be best. If you
have some sort of key that you're using to search through
the data, then it depends.

A hash table will generally be better, like Shruti said, but
if your container has few values and your key is large, then
doing a binary search might be faster than computing a hash
value for your key. That, of course, requires your Binary
Tree to be sorted and at least somewhat optimized (not all
branching the same direction). If your data is mostly
ordered, it's also possible to optimize your binary tree
search based on your previous search, but that will slow
down random data. I personally use hash tables or...

A fourth option (if memory permits) is to convert your key
to an integer and use an array. This one is quite easy to
implement (Boost even has one that is STL compliant, w/o
vector's overhead), and unless memory cache sizes come
heavily into play, this one is unbeatable. An example would
be looking up a state's name by the two letter abbreviation.
An array of 32768 char*'s isn't much, and on most computers
(including any x86/x86_64) you can simply look it up by
array[*(int*)"NY"].

Is This Answer Correct ?    21 Yes 0 No

Which of the following data structures is on average the fastest for retrieving data: 1)..

Answer / k.kavitha

3)stack

Is This Answer Correct ?    8 Yes 23 No

Post New Answer

More C Interview Questions

1 What is a Data Structure?

1 Answers  


Why calloc is better than malloc?

0 Answers  


What are loops in c?

0 Answers  


How important is structure in life?

0 Answers  


whats the use of header file in c?

2 Answers  


What is signed and unsigned?

0 Answers  


can any one tell that i have a variable which is declared as static but i want this variable to be visible to the other files? how?

2 Answers  


What is the main difference between calloc () and malloc ()?

0 Answers  


What is a const pointer, and how does it differ from a pointer to a const?

2 Answers  


There is a practice in coding to keep some code blocks in comment symbols than delete it when debugging. How this affect when debugging?

0 Answers  


What is the scope of local variable in c?

0 Answers  


what is link list?

3 Answers  


Categories