Efficient data structure for store/search list of 1000 records
a)array b)double linked list c)circular queue d)hash table
- 3 Answers
- 11125 Views
- Value Labs, I also Faced
- E-Mail Answers
Answer Posted / kala sri
hash table
| Is This Answer Correct ? | 3 Yes | 0 No |
Post New Answer View All Answers
count = 0; for (i = 1;i < = 10; i++);count = count + i; Value of count after execution of the above statements will be a) 0 b) 11 c) 55 d) array
Explain how does flowchart help in writing a program?
How can type-insensitive macros be created?
What are examples of structures?
How can I run c program?
What are the modifiers available in c programming language?
How to compare array with pointer in c?
What are the disadvantages of external storage class?
Can a pointer be null?
What are header files and what are its uses in C programming?
Are there namespaces in c?
Write a program to print fibonacci series without using recursion?
What is function prototype in c language?
write a C program: To recognize date of any format even formats like "feb-02-2003","02-february-2003",mm/dd/yy, dd/mm/yy and display it as mm/dd/yy.
How can I trap or ignore keyboard interrupts like control-c?
