Scribd
Upload
152 views2 pages

Divide and Conquer Algorithms Assignment

This document contains an assignment on the topic of divide and conquer algorithms. The assignment contains 4 questions: 1) Solve a recurrence relation using substitution, 2) Explain how quicksort works and trace it on a sample dataset, drawing the recursive call tree. 3) Explain the three major variations of decrease and conquer with an example of each. 4) Apply Strassen's matrix multiplication on some sample matrices and discuss how it is better than direct matrix multiplication. The assignment is due on September 3rd, 2020 and was authored by Harivinod N for the Design and Analysis of Algorithms course.

Uploaded by

M.A raja
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
152 views2 pages

Divide and Conquer Algorithms Assignment

This document contains an assignment on the topic of divide and conquer algorithms. The assignment contains 4 questions: 1) Solve a recurrence relation using substitution, 2) Explain how quicksort works and trace it on a sample dataset, drawing the recursive call tree. 3) Explain the three major variations of decrease and conquer with an example of each. 4) Apply Strassen's matrix multiplication on some sample matrices and discuss how it is better than direct matrix multiplication. The assignment is due on September 3rd, 2020 and was authored by Harivinod N for the Design and Analysis of Algorithms course.

Uploaded by

M.A raja
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

Design and Analysis of Algorithms

18CS42

Module 2: Divide and Conquer

ASSIGNMENT-2
Harivinod N
Dept. of Computer Science and Engineering
VCET Puttur
Assignment-2 Due: 9/3/2020

1. Solve the following recurrence relation by substitution method.


T(n) = 9T(n/3)+4n6, n≥3 and n is a power of 3
2. Discuss how quick-sort works to sort an array and trace for the
following dataset. Draw the tree of recursive calls made.
65, 70, 75, 80, 85, 60, 55, 50, 45
3. What are the three major variations of decrease and conquer
technique? Explain with an example for each.
4. Apply Strassen's matrix multiplication to multiply following
matrices. Discuss method is better than direct matrix multiplication
method.

Harivinod N 18CS42-Design and Analysis of Algorithms Feb-May 2020 2

You might also like