Home › AKTU PYQ › Design and Analysis of Algorithm › Important Questions › Unit 1

Design and Analysis of Algorithm Unit 1 – Introduction: Algorithms and Sorting: important questions for AKTU

Unit 1 (Introduction: Algorithms and Sorting) questions that AKTU repeats most often. This unit carries about 32 marks per paper. Start with the repeated questions, then the most asked topics.

Most repeated Unit 1 questions

  • Explain Merge Sort with example and also compute time complexity. (7 marks, 2026, Comparison Based Sorting) – also asked in 2025, 2024, 2023, 2022, 2021, 2020, 2019
  • Let P be a Quick Sort Program to sort numbers in ascending order using the first element as pivot. Let t1 and t2 be the number of comparisons made by P for the inputs {1, 2, 3, 4, 5} and {4, 1, 5, 3, 2} respectively. Find the number of t1 and t2. (7 marks, 2026, Comparison Based Sorting) – also asked in 2025, 2024, 2022, 2021, 2020, 2019
  • Write an algorithm of merge sort and prove its worst time complexity. (10 marks, 2024, Comparison Based Sorting) – also asked in 2026, 2022, 2021, 2020, 2019

Most important Unit 1 topic

  • Algorithm Analysis Basics (Unit 1: Introduction: Algorithms and Sorting) – asked 25 times in 2019, 2020, 2021, 2022, 2023, 2024, 2025, 2026

Most asked Unit 1 topics

  • Algorithm Analysis Basics – asked 25 times
  • Comparison Based Sorting – asked 18 times
  • Sorting in Linear Time – asked 3 times

More Unit 1 previous year questions

  • Define algorithm and its characteristics. (2 marks, 2026, Algorithm Analysis Basics)
  • Compute the time complexity of the following recurrence relation. T(n)= √n T(√n) + n if n>2 = 2 if n=2. (2 marks, 2026, Algorithm Analysis Basics)
  • Find the total number of comparisons after using the Insertion sort on the following array. Array A= {23, 32, 40, 44, 54, 63, 72, 89}. (2 marks, 2026, Comparison Based Sorting)
  • Define growth of functions. (2 marks, 2026, Algorithm Analysis Basics)
  • Compute the time complexity of the following recurrence relation. T(n) = 2T(n-1) + n if n>1 = 1 if n=1. (7 marks, 2026, Algorithm Analysis Basics)

Unit 1 syllabus topics

  • Algorithm Analysis Basics
  • Comparison Based Sorting
  • Sorting in Linear Time