Data Structures Unit 3 – Searching, Hashing & Sorting: important questions for AKTU
Unit 3 (Searching, Hashing & Sorting) questions that AKTU repeats most often. This unit carries about 30 marks per paper. Start with the repeated questions, then the most asked topics.
Most repeated Unit 3 questions
- What is Hashing? Explain division method to compute the hash function and also explain the collision resolution strategies used in hashing. (7 marks, 2026, Hashing) – also asked in 2020, 2021, 2024
- Demonstratemerge sort algorithm to sort the following elements in ascending order : 11, 16, 13, 11, 4, 12, 6, 7. What is the time and space complexity of merge sort? (7 marks, 2025, Sorting) – also asked in 2021
- What is hashing? Give the characteristics of hash function. Explain collision resolution technique in hashing. (10 marks, 2020, Hashing) – also asked in 2026, 2023
Most important Unit 3 topic
- Sorting (Unit 3: Searching, Hashing & Sorting) – asked 14 times in 2020, 2021, 2022, 2023, 2024, 2025, 2026
Most asked Unit 3 topics
- Sorting – asked 14 times
- Hashing – asked 9 times
- Searching – asked 6 times
More Unit 3 previous year questions
- Write the algorithm of Insertion sort & sort the following list of numbers using insertion sort. 70, 17, 30, 80, 55, 1, 29, 67, 15. (7 marks, 2026, Sorting)
- Explain linear probing and quadratic probing in hashing with examples. (7 marks, 2026, Hashing)
- Write an algorithm for Heap Sort. Use Heap sort algorithm, sort the following sequence: 18, 25, 45, 34, 36, 51, 43, and 24. (7 marks, 2026, Sorting)
- Illustrate the concept of Indexed Sequential search. (2 marks, 2025, Searching)
- Construct a Hash table that contains 10 buckets and uses linear probing to resolve collisions. The key values are integers and the hash function used is key % 10. Insert values 43, 165, 62, 123, 142 in the table. Show all the steps and find the location of the key value 142? (7 marks, 2025, Hashing)
Unit 3 syllabus topics
- Searching
- Hashing
- Sorting