1 / 5

Numerical Algorithms Quiz questions

Test your knowledge on cost-optimal parallel matrix multiplication algorithms and their time complexities using sequential and parallel approaches.

crob
Download Presentation

Numerical Algorithms Quiz questions

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Numerical AlgorithmsQuiz questions

  2. What is meant by the term cost-optimal? • When the cost of computers is the lowest • When the parallel time complexity x number of processors used = sequential time complexity • When the number of lines of code is at the lower bound (minimum) • When the sequential time complexity x number of processors used = parallel time complexity

  3. What is the sequential time complexity of matrix multiplication(Matrices each n x n) • O(log n) • O(n) • O(n2) • O(n3)

  4. What is the parallel time complexity of matrix multiplication using n2 processors(Matrices each n x n) • O(log n) • O(n) • O(n2) • O(n3)

  5. What is the parallel time complexity of matrix multiplication using n2 processors and block multiplication with s x s blocks (sub-matrices)(Matrices each n x n) • O(n x s) • O(n/s) • O(n/(s x s)) • None of the other answers

More Related