MADANAPALLE INSTITUTE OF TECHNOLOGY & SCIENCE

(UGC-AUTONOMOUS INSTITUTION)
Affiliated to JNTUA, Ananthapuramu & Approved by AICTE, New Delhi
NAAC Accredited with A+ Grade, NIRF India Rankings 2024 - Band: 201-300 (Engg.)
NBA Accredited - B.Tech. (CIVIL, CSE, ECE, EEE, MECH, CST), MBA & MCA
Checklist No: IQAC/24- 25/14.16

DEPARTMENT OF COMPUTER SCIENCE & TECHNOLOGY

Assignment No I Academic Year 2024-25

Roll no.s
Set.No Questions Marks CO BL
allotted

Explain the importance of asymptotic notations in algorithm analysis. 1 1 2

Use mathematical induction to prove that the sum of the first 'n' natural numbers is 23691A28D3
1. 1 1 2 TO
n(n+1)/2. Show all steps of the induction process.
23691A28E1
Given a sorted array A = {2, 5, 8, 12, 16, 23, 38, 56, 72, 91}, search for the element 23
1 2 3
using Binary Search and show the step-by-step process.
Summarize the role of best-case, worst-case, and average-case complexities in evaluating
1 1 2
algorithms.
Use mathematical induction to prove that the sum of the first 'n' natural numbers is 23691A28E2
2. 1 1 2 TO
n(n+1)/2. Show all steps of the induction process.
23691A28F0
Sort the array A = {10, 80, 30, 90, 40, 50, 70} using Quick Sort and illustrate the
1 2 3
partitioning process at each step.
Illustrate the concept of order of growth with common examples like O(1), O(n), O(log
1 1 2
n), and O(n²).
Given the recurrence relation T(n) = 2T(n/2) + n, use the substitution method to find the 23691A28F1
3. 1 1 2 TO
asymptotic time complexity. Show all the steps of the substitution.
23691A28G0
Sort the array A = {12, 11, 13, 5, 6, 7} using Merge Sort and demonstrate the merging
1 2 3
process step-by-step.

Explain how recurrence relations are used in analyzing recursive algorithms. 1 1 2

State the Master Theorem. Given the recurrence relation T(n) = 9T(n/3) + n^2, apply the 23691A28G1
4. Master Theorem to find the asymptotic time complexity. Explain which case of the 1 1 2 TO
Master Theorem you are using. 23691A28G8

Compute the product of matrices using Strassen’s Algorithm with Example. 1 2 3

Describe the Substitution Method for solving recurrence relations with an example. 1 1 2

Find the maximum and minimum elements in the array A = {100, 5, 1, 20, 40, 60, 2} 23691A28G9
5. 1 2 3 TO
using Divide and Conquer, and count the number of comparisons made.
23691A28H7
Explain how the Closest Pair of Points algorithm works using the Divide and Conquer
1 2 3
approach.
Explain the Recursion Tree Method and solve the recurrence T(n) = 2T(n/2) + n using
1 1 2
this method.
Given the points (2, 3), (12, 30), (40, 50), (5, 1), (12, 10), (3, 4), find the closest pair 23691A28H8
6. 1 2 3 TO
using the Divide and Conquer approach.
23691A28I7
Apply Strassen’s Matrix Multiplication algorithm to explain how it improves the
1 2 3
efficiency of matrix multiplication.
23691A28I8
7. Illustrate the Master’s Theorem and apply it to solve T(n) = 4T(n/2) + n². 1 1 2
TO
 Find the Convex Hull for the set of points (1,2), (2,4), (4,3), (3,5), (3,3), (4,5), (6,4) using
1 2 3
the Divide and Conquer algorithm and illustrate the result. 23691A28J6
Illustrate the steps of Quick Sort on an unsorted array and discuss its worst-case and
1 2 3
best-case complexities.

Describe how induction is used in the mathematical analysis of algorithms. 1 1 2

Apply the Divide and Conquer approach to find the maximum and minimum elements in 23691A28J8
8. 1 2 3 TO
the array A = {38, 28, 13, 12, 27, 3, 50, 6}, and count the number of comparisons made.
24695A2817
Apply Strassen’s Matrix Multiplication algorithm to explain how it improves the
1 2 3
efficiency of matrix multiplication.

Course Instructor Course Coordinator HOD