Write binary search. Consider a hash table of size 10; insert the keys 62, 37, 36, 44, 67, 91 and 107 using linear probing.
Marks: 5Chapter: Unit 9: Searching (5Hrs)
Chapter Study
BCA Semester 3 – Data Structure and Algorithms – Unit 9: Searching (5Hrs)
Comprehensive questions and detailed answers for Unit 9: Searching (5Hrs). Perfect for exam preparation and concept clarity.
7
Questions
35
Marks
Write binary search. Consider a hash table of size 10; insert the keys 62, 37, 36, 44, 67, 91 and 107 using linear probing.
MediumTHEORY5 marks2019(TU FOHSS Final)
What is hashing? Explain with example the collision resolution method open hashing.
MediumTHEORY5 marks2021(TU FOHSS Final)
What is hashing? Describe the types of collision resolution techniques with suitable example.
MediumTHEORY5 marks2022(TU FOHSS Final)
Define divide and conquer algorithm. What is binary search? Write an algorithm to search an item using binary search with suitable illustration.
MediumTHEORY5 marks2022(TU FOHSS Final)
Define hashing. Explain how to resolve collisions during hashing using open addressing.
MediumTHEORY5 marks2023(TU FOHSS Final)
What is binary search? Trace the algorithm of binary search to search a key 12 in the data:
MediumTHEORY5 marks2023(TU FOHSS Final)
How does collision occur during hashing? Explain any two hashing functions.
MediumTHEORY5 marks2024(TU FOHSS Final)
Showing 7 questions
Sample Questions
What is hashing? Explain with example the collision resolution method open hashing.
Marks: 5Chapter: Unit 9: Searching (5Hrs)
What is hashing? Describe the types of collision resolution techniques with suitable example.
Marks: 5Chapter: Unit 9: Searching (5Hrs)
Define divide and conquer algorithm. What is binary search? Write an algorithm to search an item using binary search with suitable illustration.
Marks: 5Chapter: Unit 9: Searching (5Hrs)
Define hashing. Explain how to resolve collisions during hashing using open addressing.
Marks: 5Chapter: Unit 9: Searching (5Hrs)
And more questions available on this page.