Design and Analysis of Algorithm Unit 1 Notes AKTU (BCS503)

AKTU · BTECH · Semester 5 · Design and Analysis of Algorithm · Unit 1 · Notes

AKTU Design and Analysis of Algorithm (BCS503) Unit 1 notes for B.Tech Semester 5 – Introduction: Algorithms and Sorting. Topics: Algorithm Analysis Basics…

Open the interactive reader to study this resource on AcademicArk.

Unit 1: Introduction: Algorithms and Sorting – AKTU syllabus topics

  • Algorithm Analysis Basics: Complexity of Algorithms, Growth of Functions, Performance Measurements
  • Comparison Based Sorting: Shell Sort, Quick Sort, Merge Sort, Heap Sort
  • Sorting in Linear Time

Most asked AKTU PYQ questions from Unit 1

  1. Q2d. Explain Merge Sort with example and also compute time complexity. (7 marks, 2025-26)
  2. Q1a. Define algorithm and its characteristics. (2 marks, 2025-26)
  3. Q2b. 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, 2025-26)
  4. Q1e. Define growth of functions. (2 marks, 2025-26)
  5. Q3b. Write an algorithm of merge sort and prove its worst time complexity. (10 marks, 2023-24)
  6. Q2a. Explain Merge sort algorithm and sort the following sequence {23, 11, 5, 15, 68,31, 4, 17} using merge sort. (10 marks, 2022-23)
  7. Q2a. Compute the time complexity of the following recurrence relation. T(n) = 2T(n-1) + n if n>1 = 1 if n=1. (7 marks, 2025-26)
  8. Q3a. Write Quick –Sort partition algorithm. Drive best and worst case time complexity of quick sort. (7 marks, 2024-25)
  9. Q2a. Solve the recurrence i) T (n) = 3T (n/4) + cn² using recursion tree method. ii) T (n) = n + 2T (n/2) using Iteration method. (Given T(1)=1) (10 marks, 2021-22)
  10. Q2a. Sort the following array by counting sort A={2,5,3,0,2,3,0,3} (10 marks, 2023-24)

AKTU paper codes: BCS503, KCS503, RCS502

Other Design and Analysis of Algorithm units

Design and Analysis of Algorithm previous year papers

More Design and Analysis of Algorithm resources

More versions of this resource

Browse all notes · Semester 5 notes