Expert answer:design and analysis of algorithms
Solved by verified expert:recurrence relations and matrices and binary search algorithmsproblems on uploaded doc
hw2.pdf
Unformatted Attachment Preview
CS 331 Design and Analysis of Algorithms
Homework #2
(Due: 10/26/17)
Note: Turn in your homework with a cover sheet including your name and last 4 digits of your
student ID # so that your grade can be correctly recorded. Write on only one side of each page.
(Total: 100 points)
1. (25 points) Given the recurrence relations. Find T(1024).
T(n) = 2T(n/4) + 2n + 4 for n > 1
T(1) = 1
2. (25 points) Given two matrices A and B.
3 0 3 1
2 4
5 3 1 0
1 3
A
B
3 0 3 1
3 0
1 2 2 5
0 4
5
2
5
1
2
1
0
4
(a) Calculate the product C (=AxB) using the Strassen’s matrix multiplication algorithm.
Show all steps.
(b) Count exactly how many basic multiplication operations and basic addition
operations are there in your calculation.
3. (25 points)
(a) Design a variant “binary” search algorithm which splits the set not into 2 sets of equal
sizes (½ and ½), but into 2 sets of sizes one quarter (1/4) and three quarters (3/4).
(b) Give the recurrence relations of your algorithm.
(c) How does this algorithm compare with the original binary search in both the best case
complexity and the worst case complexity?
4. (25 points) Solve the following recurrence relations.
3T(n/3) + 4n
if n > 1
1
if n = 1
T(n) =
…
Purchase answer to see full
attachment
How it works
- Paste your instructions in the instructions box. You can also attach an instructions file
- Select the writer category, deadline, education level and review the instructions
- Make a payment for the order to be assignment to a writer
- Download the paper after the writer uploads it
Will the writer plagiarize my essay?
You will get a plagiarism-free paper and you can get an originality report upon request.
Is this service safe?
All the personal information is confidential and we have 100% safe payment methods. We also guarantee good grades