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 is an ERP?

2 Answers   Infotech,


Explain what would happen to x in this expression: x += 15; (assuming the value of x is 5)

0 Answers  


Write the following function in C. stripos — Find position of first occurrence of a case- insensitive string int stripos ( char* haystack, char* needle, int offset ) Returns the numeric position of the first occurrence of needle in the haystack string. Note that the needle may be a string of one or more characters. If needle is not found, stripos() will return - 1. The function should not make use of any C library function calls.

3 Answers   Google, Infosys, JTL, OpenFeel,


What is a sequential access file?

0 Answers  


What does stand for?

0 Answers  






Wt are the Buses in C Language

0 Answers   Infosys,


why we shiuld use main keyword in C

5 Answers  


What is storage class?

0 Answers  


Why the below program throughs error during compilation? #include<stdio.h> #include<conio.h> enum { ZERO, ONE, TWO, }; main() { printf("%d",&TWO); getch(); }

2 Answers  


What is the use of sizeof () in c?

0 Answers  


yogesh patil in dell

3 Answers   DELL,


How to implement call back functions ?

3 Answers   HP,


Categories