Scribd
Upload
2 views5 pages

Ada Imp Que All

The document outlines a series of questions and topics related to algorithms and data structures across five modules. Key topics include algorithm design, efficiency analysis, sorting algorithms, matrix multiplication, tree structures, and optimization problems such as the knapsack problem and the Travelling Salesman Problem. Each module contains specific tasks such as developing algorithms, analyzing their complexities, and applying various algorithmic techniques.

Uploaded by

charantm8787
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
2 views5 pages

Ada Imp Que All

The document outlines a series of questions and topics related to algorithms and data structures across five modules. Key topics include algorithm design, efficiency analysis, sorting algorithms, matrix multiplication, tree structures, and optimization problems such as the knapsack problem and the Travelling Salesman Problem. Each module contains specific tasks such as developing algorithms, analyzing their complexities, and applying various algorithmic techniques.

Uploaded by

charantm8787
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/ 5

ADA QUESTIONS

MODULE 1

1. With neat diagram explain different steps in designing and analyzing an algorithm.

2. Explain the concept of asymptotic notations and basic efficiency classes, with examples.
Explain O, θ, and Ω, with examples.

3. Explain the general plan for analyzing the efficiency of a recursive algorithm. Develop
a recursive algorithm to find factorial of +ve number. Derive its efficiency in terms of order of
growth.

4. Explain the general plan for analyzing the efficiency of a non-recursive algorithm.
Suggest a non-recursive algorithm to find maximum element in the list of n numbers.
Derive its efficiency

5. Develop an algorithm to sort the array using bubble sort. Calculate best, worst & average case for
this algorithm.

6. Develop an algorithm to search an element in the array using sequential search. Calculate best,
worst & average case for this algorithm.

7. Define Algorithm? Explain the worst case, best case and average case efficiencies, with an
algorithm.

8. Give the mathematical analysis of non recursive Matrix Multiplication Algorithms.

9. Order of Growth

MODULE 2

1. Explain the concept of divide and conquer. Design an algorithm for merge sort and
derive its time complexity

2. Define & Design an insertion sort algorithm and obtain its time complexity. Apply insertion sort
on these elements. 25,75,40,10,20,

3. Explain Strassen’s matrix multiplication and derive its time complexity.

4. Define & Design an algorithm for quick sort algorithm. Apply quick sort on these elements.
25,75,40,10,20,05,15

5. Apply a quick sort algorithm to sort the list E, X, A, M, P, L, E in alphabetical order. Draw the
tree of recursive calls made( Practice similar type questions/problems)

6. Explain in detail about the Travelling Salesman Problem using exhaustive search- 12m

7. Explain in detail about the knapsack problem and closest pair problem

8. Define & Design an algorithm for insertion sort algorithm. Explain with one example.
MODULE 3

1. Define AVL Trees. Explain its four rotation types.

2. Construct bottom up heap for the list 2,9,7,6,5,8. Obtain its time complexity

3. Define heap. Explain the properties of heap along with its representation.

4. Design Horspools algorithm for string matching. Apply Horspools algorithm to find
the pattern BARBER in the text: JIM_SAW_ME_IN_A_BARBERSHOP

5. Sort the list 62,31,84,96,19,47 using comparison counting sorting and Analyze the
efficiency.

6. Explain all the 4cases in horspool’s algorithm. write the algorithm for ShiftTable.

7. Explain comparison counting sorting with algorithm with time efficiency.

8. Sort the array 2,9,7,6,5,8 by heap sort. Analyze the efficiency

9. Define 2-3 tree. Give the worst case efficiency of operations on 2-3 tree. Build 2-3 tree for the list
of keys 9, 5, 8, 3, 2, 4, 7 by indicating each step of key insertion and node splits.

MODULE 4

2.

3.
4.

5.

6. Apply Dijkstra’s algorithm to find single source shortest path for the given graph by
considering S as the source vertex.

7.
8. Write the Floyd's Algorithm for computing the All Pairs Shortest Path in a Digraph. Apply the
same to find the All Pairs Shortest Path problem for the given Digraph.

9. Using dynamic programming, solve the following knapsack instance M=6,


(w1,w2,w3,w4,w5)=(3,2,1,4,5) , (p1,p2,p3,p4,p5)=(25,20,15,40,50).

10. Solve the following knapsack problem using memory function where n=4,w=5 w={ 2,1,5,2}
v={8,6,16,11}.

MODULE 5

1. Explain the following with examples


i) P problem
ii) NP Problem
iii) NP- Complete problem
iv) NP – Hard Problems

2. What is backtracking? Apply backtracking to solve the below instance of sum of subset
problem S={5,10,12,13,15,18} d=30

3. Illustrate N queen’s problem using backtracking to solve 4-Queens problem

4.

5. Differentiate between Branch and Bound technique and Backtracking. Apply backtracking to
solve the following instance of subset-sum problem S = \{3, 5, 6, 7\} and d = 15 Construct a state
space tree.

6. Explain greedy approximation algorithm to solve discrete knapsack problems


7.

You might also like