CSN-212: Design and Analysis of Algorithms

Tutorial 6(Strassen’s Matrix Mult., Binomial and Fibonacci Heap)

Date: 19/04/2021

Instructions: Submission deadline: 25/04/2021

1. Answers should be hand written only.

2. Marks will be deducted for copying answers.
3. Marks will be deducted for late submissions.

Questions: Total Marks = 28

1. What will be the binomial heap after extracting the node with minimum key from the
given binomial heap? Show the each steps. [5]

2. Building Binomial Heap in the given sequence order [37, 41, 10, 28, 77, 13, 6, 8, 14,
29, 11, 17, 38]. Show all the steps. [5]

3. What will be the union of the given Fibonacci heap H1 and H2 as show below?
Explain each steps. [3]
 H1 H2

4. What will be the Fibonacci heap after extracting the node with minimum key from
the given Fibonacci heap? Show all the steps. [5]

5. How would you modify Strassen’s algorithm to multiply n×n matrices in which n is
not an exact power of 2? Show that the resulting algorithm runs in time Ө(nlg 7). [5]

6. What is the largest k such that if you can multiply 3×3 matrices using k
multiplications (not assuming commutativity of multiplication), then you can
multiply n×n matrices in time O(nlg 7)? What is the running time of this algorithm?
[5]