Jobs in Pune | Work better in teams | Socialize with friends | Submit Q&A | Tell a friend

Search site for 

• Create an algorithm that can store 100 business cards and return the information quickly(no external databases), keeping in mind that the company would want to increase the no. of cards later !

   5,260 Views  |   (12 votes, avg: 3.08)

   Loading ...
    

Answers »

1. Submitted By: J1gs4w — June 1, 2008 +1 votes   + -

   Use a hash table or a BST.

3. Submitted By: vinay chilakamarri — October 26, 2008 +5 votes   + -

   Hashtable would required an extra overhead of Synchronization. If its not a case of multiple threads, I would use HashMap and if required, use “Collections.synchronizedMap” to make it thread safe. But I concur with the kind of data structure the above poster used.

4. Submitted By: vinay chilakamarri — October 26, 2008 +3 votes   + -

   Also its important to have that datastructure as a “Serializable” class so you can persist it to the file system. Make your own serialVersionUID just in case

5. Leave an Answer/Comment

   Name (required)

   Mail (will not be published) (required)

   Your Answer

   To prove you're a person (not a spam script), type the security text shown in the picture. Click here to regenerate some new text.
   

Contact Us | FAQ | Sitemap | Terms of Use | Privacy Policy | Tell a Friend

Copyright © 1999-2006 Jeeve Technologies LLC. All rights reserved.