Chapter Study

BCA Semester 3 Data Structure and Algorithms () Questions & Answers | Past TU Exam Papers

Practice from Data Structure and Algorithms with detailed solutions and model answers from past Tribhuvan University exams.

1
Questions
10
Marks
Back to All Chapters

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)
Showing 1 questions

Unit 8: Sorting (5Hrs) chapter questions with answers for Data Structure and Algorithms (BCA Semester 3). Prepare for TU exams with our comprehensive question bank and model answers.