What is heap? Explain quick sort algorithm with Big-oh notation in best case, average case and worst case and trace it to sort the data: 8, 10, 5, 12, 14, 5, 7, 13.
Marks: 10Chapter: Unit 8: Sorting (5Hrs)
Chapter Study
BCA Semester 3 – Data Structure and Algorithms – Unit 8: Sorting (5Hrs)
Comprehensive questions and detailed answers for Unit 8: Sorting (5Hrs). Perfect for exam preparation and concept clarity.
5
Questions
40
Marks
What is heap? Explain quick sort algorithm with Big-oh notation in best case, average case and worst case and trace it to sort the data: 8, 10, 5, 12, 14, 5, 7, 13.
MediumTHEORY10 marks2019(TU FOHSS Final)
What is insertion sort? Trace and sort the following data using insertion sort:
MediumTHEORY5 marks2021(TU FOHSS Final)
What is external sorting? Explain heap sort algorithm and trace it to sort the data:
HardTHEORY10 marks2022(TU FOHSS Final)
Define complete binary tree and skewed tree. Write a function to implement heap sort and sort the following data using heap sort:
HardTHEORY10 marks2023(TU FOHSS Final)
Implement the quick sort to sort the following data items:
MediumTHEORY5 marks2024(TU FOHSS Final)
Showing 5 questions
Sample Questions
What is insertion sort? Trace and sort the following data using insertion sort: \(90, 57, 80, 10, 22, 21, 45, 9, 78\)
Marks: 5Chapter: Unit 8: Sorting (5Hrs)
What is external sorting? Explain heap sort algorithm and trace it to sort the data:$ 82, 90, 10, 12, 15, 77, 55, 23, 25, 32 $
Marks: 10Chapter: Unit 8: Sorting (5Hrs)
Define complete binary tree and skewed tree. Write a function to implement heap sort and sort the following data using heap sort: $ 12, 9, 1, 13, 16, 24, 21, 5 $
Marks: 10Chapter: Unit 8: Sorting (5Hrs)
Implement the quick sort to sort the following data items: \( 12, 1, 14, 7, 2, 10, 4, 7, 22, 6, 15 \)
Marks: 5Chapter: Unit 8: Sorting (5Hrs)