Scribd
Upload
21 views

DSA Unit 1 QB and Notes

Uploaded by

facapa9164
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
21 views

DSA Unit 1 QB and Notes

Uploaded by

facapa9164
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Unit -1

5 Marks questions:-
1) Define Algorithms and explain the role of algorithms in computing.
2) Define the Divide-and-Conquer approach and provide a basic example
where this strategy is applied.
3) Solve (using Master Method) T(n)=8T(N/2)+N2 (to the power of 2)
Solve T(n)=T(n/2)+c.
4) Solve T(n)=2T(n/2)+CN Using Recursive tree method.
5) Solve T(n)=T(n-1)+n Using Back Substitution method.

10 Marks Questions:-
1) Explain insertion sort algorithm with code and its time complexcity.
2) Analyze the recursion-tree method for solving recurrences. Explain its use
in solving the recurrence relation for Merge Sort.
3) Develop a program to perform Strassen’s algorithm for matrix
multiplication.
4) Using the Master Theorem, solve the following recurrence relation and
determine its time complexity:
T(n)=2T(n/2)+n2 (Explain the steps and conditions of the Master Theorem
that apply to this recurrence.)
5) Define the concept of asymptotic notation and explain the three
common types: Big-O, Omega (Ω), and Theta (Θ).

20 Marks Questions
1) Design an algorithm using the Divide-and-Conquer approach to multiply
two ( n times n) matrices. Compare its efficiency to Strassen’s matrix
multiplication algorithm.
2) Evaluate the performance of different methods for solving recurrences:
Substitution method, recursion-tree method, and master theorem. Discuss
the strengths and limitations of each method, using examples to illustrate.

1 Data Structure & Algorithms By Mrs.Nagavaralakshmmi

You might also like