Data Structures Unit 3 Handwritten Notes AKTU (BCS301)

AKTU · BTECH · Semester 3 · Data Structures · Unit 3 · Handwritten Notes

AKTU Data Structures (BCS301) Unit 3 handwritten notes for B.Tech Semester 3 – Searching, Hashing & Sorting. Topics: Searching, Hashing, Sorting. Read free…

Open the interactive reader to study this resource on AcademicArk.

Unit 3: Searching, Hashing & Sorting – AKTU syllabus topics

  • Searching: Binary Search, Index Sequential Search
  • Hashing: Collision Resolution Techniques
  • Sorting: Insertion Sort, Selection Sort, Bubble Sort, Quick Sort, Merge Sort, Heap Sort, Radix Sort

Most asked AKTU PYQ questions from Unit 3

  1. Q5a. What is Hashing? Explain division method to compute the hash function and also explain the collision resolution strategies used in hashing. (7 marks, 2025-26)
  2. Q5b. What is hashing? Give the characteristics of hash function. Explain collision resolution technique in hashing. (10 marks, 2019-20)
  3. Q2c. Explain any three commonly used hash function with the suitable example? A hash function H defined as H(key) =key%7, with linear probing, is used to insert the key 37,38,72,48,98,11,66 into a table indexed from 0 to 6. what will be the location of key 11? Justify your answer, also count the total… (10 marks, 2020-21)
  4. Q5a. Write an algorithm for merge sort and apply on following elements 45,32,65,76,23,12,54,67,22,87. (10 marks, 2020-21)
  5. Q5b. 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, 2024-25)
  6. Qc. What are the disadvantages of linear probing in hashing? Discuss how quadratic probing can be used to solve some of these problems. (7 marks, 2023-24)
  7. Q2c. Write an algorithm for Quick sort. Use Quick sort algorithm to sort the following elements: 2, 8, 7, 1, 3, 5, 6, 4 (10 marks, 2022-23)
  8. Q5b. Write an algorithm for Heap Sort. Use Heap sort algorithm, sort the following sequence: 18, 25, 45, 34, 36, 51, 43, and 24. (10 marks, 2022-23)
  9. Q2b. Write algorithms of insertion sort. Implement the same on the following numbers; also calculate its time complexity. 13, 16, 10, 11, 4, 12, 6, 7 (10 marks, 2021-22)
  10. Q2d. Differentiate between liner and binary search algorithm. Write a recursive function to implement binary search. (10 marks, 2021-22)

AKTU paper codes: BCS301, KCS301, BCS301H, KCS301H

Other Data Structures units

Data Structures previous year papers

More Data Structures resources

Browse all notes · Semester 3 notes