Scribd
Upload
47 views2 pages

QB-2 BCS401 4th Sem

This document is a question bank for the subject 'Analysis and Design of Algorithm' for the academic year 2024-25. It includes various questions related to algorithm design concepts such as exhaustive search, divide and conquer, merge sort, quick sort, and topological sorting. The questions require explanations, algorithm constructions, and efficiency analyses for different sorting techniques and algorithms.

Uploaded by

vibhagowdaj20
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
47 views2 pages

QB-2 BCS401 4th Sem

This document is a question bank for the subject 'Analysis and Design of Algorithm' for the academic year 2024-25. It includes various questions related to algorithm design concepts such as exhaustive search, divide and conquer, merge sort, quick sort, and topological sorting. The questions require explanations, algorithm constructions, and efficiency analyses for different sorting techniques and algorithms.

Uploaded by

vibhagowdaj20
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

Subject Name : Analysis and Design of Algorithm

Subject Code :BCS401


Semester: IV Question Bank: 2
Faculty Name :Prof. ANOOP N PRASAD
Academic Year 2024-25(evensem)
Q.N
Question Bank-Module 2
o
1 Explain the Exhaustive Search along with two problems.

2 What is decrease and conquer? Explain its three variations.

3 Give the general divide and conquer recurrence and explain the same.

4 Construct an algorithm for merge sort. Analyze its efficiency.

5 Discuss how quick sort works to sort an array. Trace quick sort algorithm for the following data set 65, 70, 75, 80,
85, 60, 55, 50, 45
Consider the numbers given below. Show how partitioning algorithm of quick sort will place 106 in its correct
6 position. Show all the steps clearly. “106 117 128 134 141 91 84 63 42”
Write the merge sort algorithm and Sort the list E, X, A, M, P, L, E in alphabetical order using merge sort and
7 discuss the efficiency of merge sort.
8 Trace the merge sort algorithm for the data set 8, 4, 1, 6, 7, 2, 3, 9.
Write the merge sort algorithm and Sort the list Q,U,E,S,T,I,O,N in alphabetical order using merge sort and discuss
9 the efficiency of merge sort.
10 Construct an algorithm for Quick sort. Analyze its efficiency.
11 Explain the Multiplication of large integers algorithm with its time complexity.
12 Explai the advantage of Strassen’s Matrix Multiplication. How it is proved .
13 Write the algorithm for Insertion sort.calculate its effeciency.
14 Sort the list using Insertion sort 89, 45, 68, 90, 29, 34, 17
Explain DFS based and source Removal algorithm for topological Sort

1 2
15

3 4

What is topological sorting? Apply the same to the below graph

16

1
Obtain topological sorting for the given diagraph using source removal method
0 2

17 3 5
1

18 Write the algorithm for DFS and explain how it canbe used to solve the topological sorting problem with one
example

You might also like