vault backup: 2023-09-25 11:31:29
This commit is contained in:
parent
3c7766b6f9
commit
5b6b21e375
1 changed files with 14 additions and 0 deletions
|
@ -7,4 +7,18 @@
|
||||||
> These resolutions are using the file ***mmult.c*** available and developed by the professors.
|
> These resolutions are using the file ***mmult.c*** available and developed by the professors.
|
||||||
## Ex. 1
|
## Ex. 1
|
||||||
a)
|
a)
|
||||||
|
> [!help]- What is the complexity of the MM (i.e., in big O notation, where N is the problem size and NxN is the matrix size)?
|
||||||
|
|
||||||
|
>[!hint]- Big O Notation Cheat Sheet
|
||||||
|
>- Constant: O(1)
|
||||||
|
- Linear time: O(n)
|
||||||
|
- Logarithmic time: O(n log n)
|
||||||
|
- Quadratic time: O(n^2)
|
||||||
|
- Exponential time: O(2^n)
|
||||||
|
- Factorial time: O(n!)
|
||||||
|
|
||||||
|
>[!help]- What increase in execution time is expected when the N doubles?
|
||||||
|
|
||||||
|
>[!help]- Which component of the performance equation is affected (e.g., \#I, CPI or Tcc)?
|
||||||
|
>
|
||||||
|
|
||||||
|
|
Loading…
Reference in a new issue