Efficient data structure for store/search list of 1000 records
a)array b)double linked list c)circular queue d)hash table

Answers were Sorted based on User's Feedback



Efficient data structure for store/search list of 1000 records a)array b)double linked list c)circu..

Answer / aeini

a array

Is This Answer Correct ?    18 Yes 7 No

Efficient data structure for store/search list of 1000 records a)array b)double linked list c)circu..

Answer / kala sri

hash table

Is This Answer Correct ?    3 Yes 0 No

Efficient data structure for store/search list of 1000 records a)array b)double linked list c)circu..

Answer / prasad

array

Is This Answer Correct ?    4 Yes 2 No

Post New Answer

More C Interview Questions

What are the back slash character constants or escape sequence charactersavailable in c?

0 Answers  


What ios diff. Between %e & %f?

3 Answers   Honeywell,


How can I pad a string to a known length?

0 Answers  


How to get string length of given string in c?

0 Answers  


a sequence of bytes with one to one corrspondence to those in the external device a) sequential addressing b) address c) byte code d) none

0 Answers  


void main() { static int i = 5; if(--i) { main(); printf("%d ",i); } } what would be output of the above program and justify your answer? }

5 Answers   C DAC, CDAC, Infosys, Wipro,


what is the height of tree if leaf node is at level 3. please explain

0 Answers  


Why does this code crash?

0 Answers  


What are dynamically linked and statically linked libraries?

2 Answers  


Function to find the given number is a power of 2 or not?

20 Answers   Motorola, nvidia,


What is the hardest programming language?

0 Answers  


You have an array of n integers, randomly ordered with value 1 to n-1.The array is such that there is only one and one value occurred twice. How will you find this number?

1 Answers  


Categories