Scribd
Upload
228 views

DAA Question Bank Unit 1

This document contains a model question bank for the Design and Analysis of Algorithms course with questions ranging from short 2-mark questions to longer 10-mark questions. The questions cover topics related to algorithm analysis including asymptotic notation, solving recurrences, comparing performance of algorithms, and specific algorithms like quicksort, mergesort, heapsort, and counting sort. Examples or problems are provided for many of the questions to illustrate the concepts.

Uploaded by

praveshcode1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
228 views

DAA Question Bank Unit 1

This document contains a model question bank for the Design and Analysis of Algorithms course with questions ranging from short 2-mark questions to longer 10-mark questions. The questions cover topics related to algorithm analysis including asymptotic notation, solving recurrences, comparing performance of algorithms, and specific algorithms like quicksort, mergesort, heapsort, and counting sort. Examples or problems are provided for many of the questions to illustrate the concepts.

Uploaded by

praveshcode1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

United Institute of Technology (284)

Department of Computer Science & Engineering & Information Technology


Design and Analysis of Algorithm (KCS503)
B.Tech 3rd Year (CSE & IT)
Model Question Bank
Unit –1
Short Question
1. Justify why Quick sort is better than Merge sort? [2015-16 (2-marks)]
2. What is priority queue? [2015-16 (2-marks)]
3. Explain element searching techniques using divide and conquer approach. [2015-16 (2-
marks)]
4. Solve the given recurrence T(n)= 4T(n/4) +n [2015-16 (2-marks)]
5. List out the disadvantages of divide and conquer algorithm. [2016-17 (2-marks)]
6. What are the fundamental steps involved in algorithmic problem solving? [2016-17 (2-
marks)]
7. Define Binary heap. [2016-17 (2-marks)]
8. Write the names of various design techniques of algorithm. [2016-17 (2-marks)]
9. Show that the solution to T (n) = 2T (⌊n/2⌋ + 17) + n is O (n lg n). [2018-19 (2-marks)]
10. Quick sort is fastest comparison sorting algorithm in the average case. Are you agree with this
statement? Justify your answer. [2018-19 (2-marks)]
11. What do you mean by stability of a sorting algorithm? Explain its application. [2018-19 (2-
marks)]
12. How do you compare the performance of various algorithms? [2019-20 (2-marks)]
13. Take the following list of functions and arrange them in ascending order of growth rate. That
is, if function g(n) immediately follows function f(n) in your list, then it should be the case
that f(n) is O(g(n)). f1(n) = n2.5, f2(n) = √2n, f3(n) = n + 10, f4(n) = 10n, f5(n) = 100n, and
f6(n) = n2 log n [2019-20 (2-marks)]
14. Define feasible and optimal solution. [2019-20 (2-marks)]
15. What is recurrence relation? How is recurrence solve using master’s theorem? [2020-21 (2-
marks)]
16. What is asymptotic notation? Explain Omega () notation. [2020-21 (2-marks)]
17. Solve the given recurrence T(n)= 4T(n/4) +n2 [2020-21 (2-marks)]
18. Explain how algorithm performance is analysed? [2020-21 (2-marks)]
19. Explain searching technique using divide and conquer approach. [2020-21 (2-marks)]
20. Discuss the basic steps in the complete development of an algorithm. [2022-23 (2-marks)]
21. Explain and compare best and worst time complexity of Quick Sort. [2022-23 (2-marks)]

Long Questions
1. What is heap sort? Apply heap sort algorithm for sorting '1,2,3, 4, 5, 6,7, 8, 9., 10. Also
deduce time complexity of heap sort. [2015-16 (5-marks)]
2. Explain the concepts of quick sort method and analyse its complexity with suitable example.
[2016-17 (5-marks)]
3. Explain the concept of merge sort with example. [2016-17 (5-marks)]
4. Solve the recurrence: T (n) = 50 T (n/49) + log n! [2018-19 (10-marks)]

Prepared by:
Mr. Rohit Mishra
5. Illustrate the operation of Quick sort on the array, A= (9, 14, 87, 4, 32, 86, 67) [2018-19 (-
marks)]
6. Solve the recurrence using recursion tree method: T (n) = T (n/2) + T (n/4) + T (n/8) + n
[2018-19 (2-marks)]
7. Use a recursion tree to give an asymptotically tight solution to the recurrence T(n) = T(αn) +
T((1 -α)n) + cn, where α is a constant in the range 0 <α< 1 and c> 0 is also a constant. [2018-
19 (7-marks)]
8. The recurrence T (n) = 7T (n/3) + n2 describes the running time of an algorithm A. Another
competing algorithm B has a running time of S (n) = a S (n/ 9) + n2. What is the smallest
value of ‘a’ such that A is asymptotically faster than B.? [2018-19 (7-marks)]
9. How will you sort following array A of elements using heap sort: A = (23, 9, 18, 45, 5, 9, 1,
17, 6). [2018-19 (7-marks)]
10. Solve the recurrence T (n) = 2T(n/2) + n2+ 2n+ 1 [2019-20 (7-marks)]
11. Prove that worst case running time of any comparison sort is Ω(nlogn) [2019-20 (7-marks)]
12. Among Merge sort, Insertion sort and quick sort which sorting technique is the best in worst
case. [2019-20 (7-marks)]
13. Apply the best one among these algorithms to Sort the list E, X, A, M, P, L, E in alphabetic
order. [2019-20 (7-marks)]
14. Solve the recurrence using recursion tree method: T (n) = T (n/2) + T (n/4) + T (n/8) + n
[2019-20 (7-marks)]
15. Write an algorithm for counting sort. Illustrate the operation of counting sort on the following
array: A={4,0,2,0,1,3,5,4,1,3,2,3}[2020-21 (10-marks)]
16. Solve the following recurrence relation: [2020-21 (10-marks)]
a. T(n) =T(n-1) + n4
b. T(n) =T(n/4) + T(n/2) + n2
17. Write an algorithm for insertion sort. Find the time complexity of insertion sort in all cases.
[2020-21 (10-marks)]
18. Explain Merge sort algorithm and sort the following sequence {23, 11, 5, 15, 68,31, 4,
17} using merge sort. [2022-23 (10-marks)]
19. Examine the following recurrence relation: [2022-23 (10-marks)]
(i) T (n) = T (n-1) + n 4
(ii) T (n) = T (n/4) + T (n/2) + n 2
20. Explain algorithm for counting sort. Illustrate the operation of counting sort on the
following array: A={0,1,3,0,3,2,4,5,2,4,6,2,2,3}. [2022-23 (10-marks)]

Prepared by:
Mr. Rohit Mishra

You might also like