Trace selection sort algorithm with array of numbers 2, 81, 6, 45, 11, 21, 23, 41, and 11.
Marks: 5Chapter: Unit 6: Sorting (8 Hrs.)
Chapter Study
Bsc CSIT Semester 3 – Data Structure and Algorithms – Unit 6: Sorting (8 Hrs.)
Comprehensive questions and detailed answers for Unit 6: Sorting (8 Hrs.). Perfect for exam preparation and concept clarity.
8
Questions
40
Marks
Trace selection sort algorithm with array of numbers 2, 81, 6, 45, 11, 21, 23, 41, and 11.
MediumTHEORY5 marks2080(TU Final)
Write a program to implement insertion sort.
MediumTHEORY5 marks2080(TU Final)
Sort the number {82, 73, 12, 39, 26, 88, 2, 9, 60, 41} using shell sort.
MediumTHEORY5 marks2081(TU Final)
Sort the numbers 82,73,12,39,26,88,2,9,60,41 using shell sort.
MediumTHEORY5 marks2079(TU Final)
In which case the position of pivot element in quick sort always either in the last or the first position? Create a max heap from the numbers. {10,12,53,34,23,77,59,66,5,8}
MediumTHEORY5 marks2079(TU Final)
Hand test selection sort with array of numbers 4, 71, 32, 19, 61, 2, -5 in descending order.
MediumTHEORY5 marks2078(TU Final)
Write short notes on: a. Divide and Conquer sorting b. AVL Tree
MediumTHEORY5 marks2078(TU Final)
Hand test bubble sort with array of numbers 53, 42, 78, 3, 5, 2, 15 in ascending order.
MediumTHEORY5 marks2077(TU Final)
Showing 8 questions
Sample Questions
Write a program to implement insertion sort.
Marks: 5Chapter: Unit 6: Sorting (8 Hrs.)
Sort the number {82, 73, 12, 39, 26, 88, 2, 9, 60, 41} using shell sort.
Marks: 5Chapter: Unit 6: Sorting (8 Hrs.)
Sort the numbers 82,73,12,39,26,88,2,9,60,41 using shell sort.
Marks: 5Chapter: Unit 6: Sorting (8 Hrs.)
In which case the position of pivot element in quick sort always either in the last or the first position? Create a max heap from the numbers. {10,12,53,34,23,77,59,66,5,8}
Marks: 5Chapter: Unit 6: Sorting (8 Hrs.)
And more questions available on this page.