Chapter Study

Bsc CSIT Semester 3 – Data Structure and Algorithms – Unit 7: Searching and Hashing (6 Hrs.)

Comprehensive questions and detailed answers for Unit 7: Searching and Hashing (6 Hrs.). Perfect for exam preparation and concept clarity.

7

Questions

40

Marks

Back to All Chapters

1

Define hash table and hash function. What is collision in hashing? Explain linear probing and quadratic probing with suitable example.

HardTHEORY10 marks2080(TU Final)

2

Explain binary search with an example. What is the time complexity of binary search?

MediumTHEORY5 marks2080(TU Final)

3

What is hashing? how do you apply linear probing and rehashing explain with example.

MediumTHEORY5 marks2081(TU Final)

4

Write a program to implement binary search.

MediumTHEORY5 marks2079(TU Final)

5

Assume you have to store the data {0,1,2,4,5,7} into a hash table of size 5, with hash function, h(x)=x%5. Apply linear probing and double hashing as collision resolution techniques.

MediumTHEORY5 marks2079(TU Final)

6

Write a program to implement sequential search algorithm.

MediumTHEORY5 marks2078(TU Final)

7

What is hashing? Explain concept of hash table and hash function with example.

MediumTHEORY5 marks2077(TU Final)

Showing 7 questions

Sample Questions

Define hash table and hash function. What is collision in hashing? Explain linear probing and quadratic probing with suitable example.

Marks: 10Chapter: Unit 7: Searching and Hashing (6 Hrs.)

Explain binary search with an example. What is the time complexity of binary search?

Marks: 5Chapter: Unit 7: Searching and Hashing (6 Hrs.)

What is hashing? how do you apply linear probing and rehashing explain with example.

Marks: 5Chapter: Unit 7: Searching and Hashing (6 Hrs.)

Write a program to implement binary search.

Marks: 5Chapter: Unit 7: Searching and Hashing (6 Hrs.)

Assume you have to store the data {0,1,2,4,5,7} into a hash table of size 5, with hash function, h(x)=x%5. Apply linear probing and double hashing as collision resolution techniques.

Marks: 5Chapter: Unit 7: Searching and Hashing (6 Hrs.)

And more questions available on this page.