Unit 3 Important Questions of Data Structure
2 Marks Important Questions
Q1: What do you
mean by searching ?
Q2: Name two
Q4: Define index
Q5: What do you
mean by hashing ?
Q6: Classify the
hashing functions based on the various methods by
which the key value is found.
Q7: What is
various collision resolution strategies for hash table.
Q9: What is
sorting ? How is sorting essential for database applications ?
Q10: What do you
understand by stable and in-place sorting ?
Differentiate between internal and external sorting.
Q12: Give the
worst case and best case time complexity of binary search?
For all study material click here